When huge is routine: scaling genetic algorithms and estimation of distribution algorithms via data-intensive computing

DOI10.1007/978-3-642-10675-0_2zbMATH Open1202.68474OpenAlexW1534431633MaRDI QIDQ3557772FDOQ3557772

Authors: Xavier Llorà, R. H. Campbell, David E. Goldberg 

Publication date: 23 April 2010

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10675-0_2

Recommendations

• Parallelizing Evolutionary Algorithms for Clustering Data
• Evolutionary algorithms on volunteer computing platforms: The MilkyWay\@Home project
• Design of parallel estimation of distribution algorithms
• Parallel genetic algorithms. Theory and real world applications
• A review on parallel estimation of distribution algorithms

zbMATH Keywords

evolutionary computation algorithms

Mathematics Subject Classification ID

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

Cited In (2)

• Parallel metaheuristics: recent advances and new trends
• A novel distributed quantum-behaved particle swarm optimization

This page was built for publication: When huge is routine: scaling genetic algorithms and estimation of distribution algorithms via data-intensive computing

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