838 search results - page 1 / 168 » Finding Optimal Solutions to Atomix |
KI
2001
Springer
14 years 1 months ago
2001
Springer
GECCO
2000
Springer
14 years 29 days ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
AIPS
2008
13 years 11 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
AAAI
2010
13 years 10 months ago
2010
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
AAAI
1997
13 years 10 months ago
1997
