Sciweavers

4759 search results - page 12 / 952
» Parallelizing the Phylogeny Problem
Sort
View
PDCAT
2005
Springer
14 years 1 months ago
Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
Hannes Schabauer, Erich Schikuta, Thomas Weish&aum...
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
14 years 1 months 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 sho...
Xuan Liu, Hongmei He, Ondrej Sýkora