656 search results - page 2 / 132 » Complexity of finite-horizon Markov decision process problem... |
108
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
JACM
2000
15 years 1 months ago
2000
ICONIP
2009
14 years 11 months ago
2009
We study a subclass of POMDPs, called quasi-deterministic POMDPs (QDET-POMDPs), characterized by deterministic actions and stochastic observations. While this framework does not mo...
126
Voted
UAI
2000
15 years 3 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
104
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...