Modelling genetic algorithms: From Markov chains to dependence with complete connections
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part I: Basic properties of selection and mutationIEEE Transactions on Neural Networks, 1994
- A Markov Chain Framework for the Simple Genetic AlgorithmEvolutionary Computation, 1993
- Non-negative Matrices and Markov ChainsPublished by Springer Nature ,1981