Non-existence of linear universal drift functions

DOI10.1016/j.tcs.2012.01.048zbMath1247.68251arXiv1011.3466OpenAlexW1601534271MaRDI QIDQ428906

Carola Winzen, Daniel Johannsen, Benjamin Doerr

Publication date: 25 June 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.3466

zbMATH Keywords

evolutionary algorithmsruntime analysisbio-inspired computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (3)

Drift Analysis and Evolutionary Algorithms Revisited ⋮ Adaptive drift analysis ⋮ Runtime analysis for permutation-based evolutionary algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Simplified drift analysis for proving lower bounds in evolutionary computation
• On the analysis of the \((1+1)\) evolutionary algorithm
• A study of drift analysis for estimating computation time of evolutionary algorithms
• On the impact of the mutation-selection balance on the runtime of evolutionary algorithms
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: Non-existence of linear universal drift functions