332 search results - page 30 / 67 » Traveling salesman path problems |
ASIAN
1999
Springer
14 years 5 days ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
EOR
2008
13 years 8 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Given an evolutionary algorithm for a problem and an instance of the problem, the results of several trials of the EA on the instance constitute a sample from the distrib...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...