Sciweavers

104 search results - page 5 / 21
» HTN Planning: Complexity and Expressivity
Sort
View
IJCAI
2001
13 years 8 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
ACL
2012
11 years 9 months ago
Learning High-Level Planning from Text
Comprehending action preconditions and effects is an essential step in modeling the dynamics of the world. In this paper, we express the semantics of precondition relations extrac...
S. R. K. Branavan, Nate Kushman, Tao Lei, Regina B...
IJCAI
2003
13 years 8 months ago
In Defense of PDDL Axioms
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
Sylvie Thiébaux, Jörg Hoffmann, Bernha...
SIGMOD
2003
ACM
105views Database» more  SIGMOD 2003»
14 years 7 months ago
Factorizing Complex Predicates in Queries to Exploit Indexes
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
Surajit Chaudhuri, Prasanna Ganesan, Sunita Sarawa...
AIPS
2008
13 years 9 months ago
Scheduling Meetings at Trade Events with Complex Preferences
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
Andreas Ernst, Gaurav Singh, René Weiskirch...