254 search results - page 3 / 51 » Evaluation Strategies for Planning as Satisfiability |
JAR
2000
13 years 5 months ago
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
WSC
1997
13 years 7 months ago
1997
Earthwork projects involve moving specific amounts of earth from a discrete set of source locations to a discrete set of destinations. Constructors use different methods and equip...
SSD
1999
Springer
13 years 10 months ago
1999
Springer
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
AIPS
2004
13 years 7 months ago
2004
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...