Faster black-box algorithms through higher arity operators
From MaRDI portal
Publication:5276095
DOI10.1145/1967654.1967669zbMath1369.68238arXiv1012.0952OpenAlexW2053529015MaRDI QIDQ5276095
Benjamin Doerr, Markus Wagner, Carola Winzen, Timo Kötzing, Per Kristian Lehre, Daniel Johannsen
Publication date: 14 July 2017
Published in: Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.0952
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
\textsc{OneMax} in black-box models with several restrictions ⋮ Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem ⋮ Choosing the right algorithm with hints from complexity theory ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ The unbiased black-box complexity of partition is polynomial ⋮ From black-box complexity to designing new genetic algorithms ⋮ The query complexity of a permutation-based variant of mastermind ⋮ Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity ⋮ The \((1+1)\) elitist black-box complexity of LeadingOnes ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Reducing the arity in unbiased black-box complexity ⋮ Ranking-based black-box complexity ⋮ Toward a unifying framework for evolutionary processes ⋮ An Experimental Study of Operator Choices in the $$(1+(\lambda ,\lambda ))$$ Genetic Algorithm ⋮ Unbiasedness of estimation-of-distribution algorithms
