Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem
online resource
posted on 2006-09-25, 16:44 authored by Xuan Liu, Hongmei He, Ondrej SykoraIn 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.
History
School
- Science
Department
- Computer Science
Pages
158114 bytesCitation
LIU, HE and SÝKORA, 2005. Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem. IN: First International Conference on Advanced Data Mining and Applications (ADMA), Wuhan, China, 22-24 July, Proceedings. Lecture Notes in Computer Science, 3584. Berlin : Springer Verlag, pp. 591-597Publisher
© Springer VerlagPublication date
2005Notes
This is a conference paperISBN
9783540278948ISSN
0302-9743Language
- en
