1603 search results - page 72 / 321 » Multi-Dimensional Heuristic Searching |
116
click to vote
MICAI
2004
Springer
15 years 9 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
122
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
129
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
130
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
138
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...