Paper Info
Title
Selection in Massively Parallel Genetic Algorithms
Abstract
The availability of massively parallel computers makes it possible to applygenetic algorithms to large populations and very complex applications. Amongthese applications are studies of natural evolution in the emerging field of artificiallife, which place special demands on the genetic algorithm. In this paper,we characterize the difference between panmictic and local selection/matingschemes in terms of diversity of alleles, diversity of genotypes, the inbreedingcoefficient, and the ...
Year
Venue
Keywords
1991
ICGA
genetic algorithm
Field
DocType
Citations 
Allele,Inbreeding,Computer science,Panmixia,Massively parallel,Theoretical computer science,Robustness (computer science),Genetic algorithm
Conference
116
PageRank 
References 
Authors
26.08
5
2
Search Limit
100116
Name
Order
Citations
PageRank
Robert J. Collins111626.08
David R. Jefferson21136213.09