Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/2387

Title: Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem
Authors: Liu, Xuan
He, H.
Sykora, Ondrej
Issue Date: 2005
Publisher: © Springer Verlag
Citation: 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-597
Abstract: 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.
Description: This is a conference paper
URI: https://dspace.lboro.ac.uk/2134/2387
ISBN: 0302-9743
ISSN: 9783540278948
Appears in Collections:Conference Papers (Computer Science)

Files associated with this item:

File Description SizeFormat
LHS05.pdf176.25 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.