Resampling vs Recombination

DOI10.1145/3040718.3040723zbMath1365.68389OpenAlexW2604840712MaRDI QIDQ5738853

Francesco Quinzan, Timo Kötzing, Andrew M. Sutton, Tobias Friedrich

Publication date: 13 June 2017

Published in: Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

noiserobustnessgenetic algorithmevolutionary algorithmant colony optimizationcrossoverestimation of distribution algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (1)

Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise

This page was built for publication: Resampling vs Recombination