185 search results - page 5 / 37 » Simulation-Based Optimization Algorithms for Finite-Horizon ... |
ECML
2005
Springer
14 years 1 months ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
IJCAI
2007
13 years 9 months ago
2007
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
UAI
2000
13 years 9 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...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
FLAIRS
2008
13 years 10 months ago
2008
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...