8 search results - page 1 / 2 » Memory-Bounded Dynamic Programming for DEC-POMDPs |
JAIR
2008
13 years 4 months ago
2008
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
ATAL
2007
Springer
13 years 10 months ago
2007
Springer
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 ...
IJCAI
2007
13 years 6 months ago
2007
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
IJCAI
2007
13 years 6 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
PACS
2000
Springer
13 years 8 months ago
2000
Springer
Dynamic voltage and frequency scaling has been identified as one of the most effective ways to reduce power dissipation. This paper discusses a compilation strategy that identifies...