Sciweavers

519 search results - page 67 / 104
» A Meta-CSP Model for Optimal Planning
Sort
View
ESORICS
2010
Springer
13 years 9 months ago
Secure Multiparty Linear Programming Using Fixed-Point Arithmetic
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...
Octavian Catrina, Sebastiaan de Hoogh
ATAL
2007
Springer
14 years 3 months ago
Q-value functions for decentralized POMDPs
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
Frans A. Oliehoek, Nikos A. Vlassis
AIPS
2009
13 years 10 months ago
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
Christopher Amato, Jilles Steeve Dibangoye, Shlomo...
IAT
2006
IEEE
14 years 3 months ago
A Q-decomposition LRTDP Approach to Resource Allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, the merging of tw...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
ATAL
2008
Springer
13 years 11 months ago
RIAACT: a robust approach to adjustable autonomy for human-multiagent teams
When human-multiagent teams act in real-time uncertain domains, adjustable autonomy (dynamic transferring of decisions between human and agents) raises three key challenges. First...
Nathan Schurr, Janusz Marecki, Milind Tambe