A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets (Q1278478)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets |
scientific article; zbMATH DE number 1252996
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets |
scientific article; zbMATH DE number 1252996 |
Statements
A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets (English)
0 references
22 February 1999
0 references
genetic algorithm
0 references
stopping criteria
0 references
run time behavior
0 references
higher cardinality
0 references
Markov chain
0 references
transition probabilities
0 references
convergence rate
0 references
0.91624546
0 references
0.89303666
0 references
0.8885056
0 references
0.88352025
0 references
0.8813085
0 references
0.87802434
0 references
