90 search results - page 3 / 18 » On the hardness of finding symmetries in Markov decision pro... |
ICTAI
2000
IEEE
13 years 11 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
FLAIRS
2008
13 years 9 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...
JAIR
2008
13 years 7 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
IJCAI
2001
13 years 8 months ago
2001
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...