Sciweavers

57 search results - page 5 / 12
» Ant Search Strategies For Planning Optimization
Sort
View
AIPS
2006
13 years 9 months ago
Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
Zhao Xing, Yixin Chen, Weixiong Zhang
ICDE
2010
IEEE
194views Database» more  ICDE 2010»
14 years 2 months ago
Visualizing cost-based XQuery optimization
Abstract— Developing a full-fledged cost-based XQuery optimizer is a fairly complex task. Nowadays, there is little knowledge concerning suitable cost formulae and optimization ...
Andreas M. Weiner, Theo Härder, Renato Olivei...
KR
2004
Springer
14 years 29 days 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
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
13 years 11 months ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
COMPGEOM
2004
ACM
14 years 1 months ago
Searching with an autonomous robot
We discuss online strategies for visibility-based searching for an object hidden behind a corner, using Kurt3D, a real autonomous mobile robot. This task is closely related to a n...
Sándor P. Fekete, Rolf Klein, Andreas N&uum...