Sciweavers

Share
ADMA
2005
Springer

Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem

10 years 21 days ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments show usefulness of the parallel GA and SA algorithms.
Xuan Liu, Hongmei He, Ondrej Sýkora
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where ADMA
Authors Xuan Liu, Hongmei He, Ondrej Sýkora
Comments (0)
books