325 search results - page 8 / 65 » Structured Reachability Analysis for Markov Decision Process... |
ATAL
2004
Springer
15 years 2 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
KI
2007
Springer
14 years 9 months ago
2007
Springer
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
95
Voted
VMCAI
2010
Springer
15 years 6 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
SODA
2010
ACM
15 years 6 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...
AAAI
1997
14 years 11 months ago
1997
Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...