58 search results - page 7 / 12 » New Approximation-Based Local Search Algorithms for the Prob... |
GECCO
2003
Springer
14 years 22 days ago
2003
Springer
Ant Colony Optimization (ACO) has been applied successfully in solving the Traveling Salesman Problem. Marco Dorigo et al. used Ant System (AS) to explore the Symmetric Traveling S...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
PVM
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...