Sciweavers

69 search results - page 2 / 14
» First Order Decision Diagrams for Relational MDPs
Sort
View
AIPS
2007
14 years 1 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
NIPS
2003
14 years 7 days ago
Approximate Policy Iteration with a Policy Language Bias
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
Alan Fern, Sung Wook Yoon, Robert Givan
AAAI
2004
14 years 8 days ago
Solving Concurrent Markov Decision Processes
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
Mausam, Daniel S. Weld
MICRO
2000
IEEE
162views Hardware» more  MICRO 2000»
14 years 2 months ago
Accurate and efficient predicate analysis with binary decision diagrams
Functionality and performance of EPIC architectural features depend on extensive compiler support. Predication, one of these features, promises to reduce control flow overhead and...
John W. Sias, Wen-mei W. Hwu, David I. August
IJCAI
2003
14 years 7 days ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...