Understanding Simple Asynchronous Evolutionary Algorithms

DOI10.1145/2725494.2725509MaRDI QIDQ2981886zbMATH OpenOpenAlexFDO

Authors

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

asynchronous algorithmsevolutionary algorithmsparallel algorithms

Mathematics Subject Classification ID

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

Recommendations

• Asynchronous Differential Evolution
• Asynchronous parallel evolutionary algorithms for constrained optimizations
• Asynchronous differential evolution with restart
• scientific article; zbMATH DE number 2013547
• scientific article; zbMATH DE number 1998333

Cites work

• Absorption time of the Moran process
• Approximating fixation probabilities in the generalized Moran process
• scientific article; zbMATH DE number 3148873 (Why is no real title available?)
• On the fixation probability of superstars

Cited in

(4)

• A study on efficient asynchronous parallel multi-objective evolutionary algorithm with waiting time limitation
• Asynchronous Differential Evolution
• scientific article; zbMATH DE number 2013528 (Why is no real title available?)
• Runtime analysis with variable cost

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2981886)