Hypomixability Elimination In Evolutionary Systems

DOI10.1145/2725494.2725511zbMath1361.68174OpenAlexW1974358715MaRDI QIDQ2981897

Keki M. Burjorjee

Publication date: 10 May 2017

Published in: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2725494.2725511

zbMATH Keywords

genetic algorithmsevolutionspeciationadaptationjuntassexhypomixabilitylearning paritiesrecombination.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Memetic algorithms outperform evolutionary algorithms in multimodal optimisation

Cites Work

• Approximating fixation probabilities in the generalized Moran process
• On the fixation probability of superstars
• Unnamed Item
• Unnamed Item

This page was built for publication: Hypomixability Elimination In Evolutionary Systems