Implicit parallelism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2724, Issue , 2003, Pages 1505-1517

  Wright, Alden H ^a   Vose, Michael D ^b   Rowe, Jonathan E ^c  

^a UNIVERSITY OF MONTANA   (United States)

^b University of Tennessee   (United States)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750276155     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45110-2_22     Document Type: Article

References (8)

1. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization & Machine Learning. Addison Wesley, Reading, MA.
2. Holland, J. (1975). Adapdation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan.
3. Koehler, Bhattacharyya, and Vose (1997). General cardinality genetic algorithms. Evolutionary Computation, 5(4):439-459.
4. Lang, S. (1993). Algebra. Addison-Wesley, Reading, MA, third edition.
5. Rowe, J.E., Vose, M.D., and Wright, A.H. (2002). Group properties of crossover and mutation. Evolutionary Computation, 10(2):151-184.
6. Stephens, C. and Waelbroeck, H. (1999). Schemata evolution and building blocks. Evolutionary Computation, 7(2).
7. Vose, M.D. (1999). The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA.
8. Vose, M.D. and Wright, A.H. (2001). Form invariance and implicit parallelism. Evolutionary Computation, 9(3):355-370.