656 search results - page 31 / 132 » Complexity of finite-horizon Markov decision process problem... |
172
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
191
click to vote
VMCAI
2010
Springer
16 years 3 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...
205
click to vote
AAAI
2012
13 years 9 months ago
2012
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
191
click to vote
QEST
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
196
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...