Fixed-target runtime analysis
From MaRDI portal
Publication:2144280
DOI10.1007/s00453-021-00881-0zbMath1490.68306arXiv2004.09613OpenAlexW3207685048MaRDI QIDQ2144280
Benjamin Doerr, Dmitry Vinokurov, Carola Doerr, Maxim Buzdalov
Publication date: 1 June 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.09613
Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Lower bounds from fitness levels made easy ⋮ Do additional target points speed up evolutionary algorithms?
Uses Software
Cites Work
- Concentration of first hitting times under additive drift
- The impact of random initialization on the runtime of randomized search heuristics
- From black-box complexity to designing new genetic algorithms
- Analyzing evolutionary algorithms. The computer science perspective.
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Multiplicative drift analysis
- Optimal parameter choices via precise black-box analysis
- Multiplicative up-drift
- Performance analysis of randomised search heuristics operating with a fixed budget
- First-hitting times under drift
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- \textsc{OneMax} in black-box models with several restrictions
- Analyzing randomized search heuristics via stochastic domination
- Combinatorial sums and finite differences
- On the analysis of a dynamic evolutionary algorithm
- Fixed Budget Performance of the (1+1) EA on Linear Functions
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- Exponential slowdown for larger populations
- Theory of Evolutionary Computation
- COCO: a platform for comparing continuous optimizers in a black-box setting
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis
- Drift analysis and average time complexity of evolutionary algorithms
This page was built for publication: Fixed-target runtime analysis
