51 search results - page 10 / 11 » A Kernighan-Lin Local Improvement Heuristic That Solves Some... |
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
PPSN
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover...