Understanding Simple Asynchronous Evolutionary Algorithms

DOI10.1145/2725494.2725509zbMath1361.68207OpenAlexW2022605100MaRDI QIDQ2981886

No author found.

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.2725509

zbMATH Keywords

parallel algorithmsevolutionary algorithmsasynchronous algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

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

This page was built for publication: Understanding Simple Asynchronous Evolutionary Algorithms