Mapping of Hierarchical Parallel Genetic Algorithms for Protein Folding onto Computational Grids
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @Article{Liu:2006:ITIS,
-
author = "Weiguo Liu and Bertil Schmidt",
-
title = "Mapping of Hierarchical Parallel Genetic Algorithms
for Protein Folding onto Computational Grids",
-
journal = "IEICE Transactions on Information and Systems",
-
year = "2006",
-
volume = "E89-D",
-
number = "2",
-
pages = "589--596",
-
email = "liuweiguo@pmail.ntu.edu.sg",
-
keywords = "genetic algorithms, genetic programming, protein
folding, HP lattice models, hierarchical parallel
genetic algorithms, computational grids, generic
programming",
-
ISSN = "0916-8532",
-
DOI = "doi:10.1093/ietisy/e89-d.2.589",
-
abstract = "Genetic algorithms are a general problem-solving
technique that has been widely used in computational
biology. In this paper, we present a framework to map
hierarchical parallel genetic algorithms for protein
folding problems onto computational grids. By using
this framework, the two level communication parts of
hierarchical parallel genetic algorithms are separated.
Thus both parts of the algorithm can evolve
independently. This permits users to experiment with
alternative communication models on different levels
conveniently. The underlying programming techniques are
based on generic programming, a programming technique
suited for the generic representation of abstract
concepts. This allows the framework to be built in a
generic way at application level and thus provides good
extensibility and flexibility. Experiments show that it
can lead to significant runtime savings on PC clusters
and computational grids.",
-
notes = "Special Section on Parallel/Distributed Computing and
Networking -- Papers -- Grid Computing Copyright 2005
IEICE",
- }
Genetic Programming entries for
Weiguo Liu
Bertil Schmidt
Citations