Phase transitions and symmetry breaking in genetic algorithms with crossover

DOI10.1016/J.TCS.2006.04.010zbMath1097.68142DBLPjournals/tcs/RogersPJ06OpenAlexW2124057453WikidataQ57377431 ScholiaQ57377431MaRDI QIDQ2503278

Nicholas R. Jennings, Adam Prügel-Bennett, Alex Rogers

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.04.010

zbMATH Keywords

phase transitiongenetic algorithmssymmetry breakingcrossover

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

The quasispecies regime for the simple genetic algorithm with ranking selection

Cites Work

• The dynamics of a genetic algorithm for simple random Ising systems
• Modeling genetic algorithms with Markov chains.
• Determining computational complexity from characteristic ‘phase transitions’
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Phase transitions and symmetry breaking in genetic algorithms with crossover