940 search results - page 7 / 188 » Control Abstractions for Local Search |
PREMI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...
ICNC
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
IDA
2003
Springer
14 years 16 days ago
2003
Springer
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
ALGORITHMICA
2010
13 years 7 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
GECCO
2005
Springer
14 years 26 days ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...