Sciweavers

334 search results - page 15 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
IJCAI
2001
14 years 11 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
ICMLA
2004
14 years 11 months ago
Planning with predictive state representations
Predictive state representation (PSR) models for controlled dynamical systems have recently been proposed as an alternative to traditional models such as partially observable Mark...
Michael R. James, Satinder P. Singh, Michael L. Li...
SIGMETRICS
2010
ACM
208views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Dynamics in congestion games
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
Devavrat Shah, Jinwoo Shin
AIPS
2009
14 years 10 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
VMCAI
2010
Springer
15 years 6 months ago
Best Probabilistic Transformers
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...
Björn Wachter, Lijun Zhang