Sciweavers

802 search results - page 33 / 161
» Experts in a Markov Decision Process
Sort
View
AAAI
1996
13 years 9 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
CBMS
2007
IEEE
14 years 2 months ago
Increasing Acceptability of Decision Trees with Domain Attributes Partial Orders
There are several domains, such as health-care, in which the decision process usually has a background knowledge that must be considered. We need to maximize the accuracy of the m...
Joan Albert López-Vallverdú, David R...
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 7 months ago
Significant Diagnostic Counterexamples in Probabilistic Model Checking
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
Miguel E. Andrés, Pedro R. D'Argenio, Peter...
AIPS
2009
13 years 8 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...
ORL
2006
87views more  ORL 2006»
13 years 7 months ago
SPAR: stochastic programming with adversarial recourse
We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We int...
Matthew D. Bailey, Steven M. Shechter, Andrew J. S...