Sciweavers

914 search results - page 10 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
IJAR
2002
93views more  IJAR 2002»
13 years 7 months ago
Troubleshooting using probabilistic networks and value of information
We develop a decision-theoretic method that yields approximate, low cost troubleshooting plans by making more relevant observations and devoting more time to generate a plan. The ...
Korhan Gökçay, Taner Bilgiç
AAAI
1998
13 years 9 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
ICML
2010
IEEE
13 years 8 months ago
Probabilistic Backward and Forward Reasoning in Stochastic Relational Worlds
Inference in graphical models has emerged as a promising technique for planning. A recent approach to decision-theoretic planning in relational domains uses forward inference in d...
Tobias Lang, Marc Toussaint
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 2 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
AIPS
2010
13 years 10 months ago
Improving Determinization in Hindsight for On-line Probabilistic Planning
Recently, `determinization in hindsight' has enjoyed surprising success in on-line probabilistic planning. This technique evaluates the actions available in the current state...
Sung Wook Yoon, Wheeler Ruml, J. Benton, Minh Do