Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions
From MaRDI portal
Publication:6623583
DOI10.1007/s00453-024-01258-9MaRDI QIDQ6623583
Johannes Lengler, Carola Doerr, Duri Andrea Janett
Publication date: 24 October 2024
Published in: Algorithmica (Search for Journal in Brave)
Cites Work
- Optimization by Simulated Annealing
- From black-box complexity to designing new genetic algorithms
- Black-box complexities of combinatorial problems
- Multiplicative drift analysis
- Black-box search by unbiased variation
- Optimal parameter choices via precise black-box analysis
- Fast mutation in crossover-based algorithms
- The runtime of the compact genetic algorithm on jump functions
- Scheduling jobs with normally distributed processing times on parallel machines
- Reducing the arity in unbiased black-box complexity
- Analyzing randomized search heuristics via stochastic domination
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Fixed Budget Performance of the (1+1) EA on Linear Functions
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- Automatic adaptation of hypermutation rates for multimodal optimisation
- The effect of non-symmetric fitness
- Theory of Evolutionary Computation
- Faster black-box algorithms through higher arity operators
- Probability Inequalities for Sums of Bounded Random Variables
- Introduction to evolutionary computing
- Stagnation detection meets fast mutation
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
- An extended jump functions benchmark for the analysis of randomized search heuristics
- Runtime analysis for permutation-based evolutionary algorithms
This page was built for publication: Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions
