Fixed Budget Performance of the (1+1) EA on Linear Functions

DOI10.1145/2725494.2725506zbMath1361.68202OpenAlexW2056898617MaRDI QIDQ2981882

Johannes Lengler, Nicholas Spooner

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.2725506

zbMATH Keywords

evolutionary algorithmlinear functions\((1+1)\) EAfixed budget

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

On easiest functions for mutation operators in bio-inspired optimisation ⋮ Fixed-target runtime analysis ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ Analyzing randomized search heuristics via stochastic domination

Cites Work

• Approximating fixation probabilities in the generalized Moran process
• On the fixation probability of superstars
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixed Budget Performance of the (1+1) EA on Linear Functions