Sciweavers

80 search results - page 4 / 16
» On the application of least-commitment and heuristic search ...
Sort
View
ECAI
2004
Springer
13 years 11 months ago
Multiple Relaxations in Temporal Planning
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classic...
Keith Halsey, Derek Long, Maria Fox
WISE
2009
Springer
14 years 1 months ago
Recommending Improvements to Web Applications Using Quality-Driven Heuristic Search
Planning out maintenance tasks to increase the quality of Web applications can be difficult for a manager. First, it is hard to evaluate the precise effect of a task on quality. S...
Stéphane Vaucher, Samuel Boclinville, Houar...
CP
2010
Springer
13 years 4 months ago
Heuristics for Planning with SAT
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Jussi Rintanen
AI
2011
Springer
13 years 1 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
ICTAI
2002
IEEE
13 years 11 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali