265 search results - page 5 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
TCBB
2008
13 years 7 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
EOR
2008
13 years 7 months ago
2008
For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
SOCO
2010
Springer
2010
Springer
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
13 years 5 months ago
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
— In this paper, the performance of a sequential Differential Evolution (DE) enhanced by neighborhood search (SDENS) is reported on the set of benchmark functions provided for th...
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 ...