2157 search results - page 420 / 432 » Binary ant algorithm |
KR
2004
Springer
14 years 21 days ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
XSYM
2004
Springer
14 years 20 days ago
2004
Springer
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
COMPGEOM
2003
ACM
14 years 18 days ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
GECCO
2003
Springer
14 years 17 days ago
2003
Springer
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
WDAG
2009
Springer
13 years 12 months ago
2009
Springer
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...