Sciweavers

655 search results - page 21 / 131
» Evolving Heuristics for Planning
Sort
View
IJCAI
2001
15 years 1 months ago
Reviving Partial Order Planning
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make ...
XuanLong Nguyen, Subbarao Kambhampati
GPEM
2010
104views more  GPEM 2010»
14 years 10 months ago
Genetic Programming and Evolvable Machines: ten years of reviews
The journal and in particular the resource reviews have been running for ten years. There are a number of activities being planned to celebrate. However it is a good time to revisi...
William B. Langdon, Steven M. Gustafson
EVOW
2010
Springer
15 years 3 months ago
On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme
Divide-and-Evolve (DaE) is an original "memeticization" of Evolutionary Computation and Artificial Intelligence Planning. DaE optimizes either the number of actions, or t...
Jacques Bibai, Pierre Savéant, Marc Schoena...
AI
2010
Springer
14 years 12 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
KR
2004
Springer
15 years 5 months ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen