The impact of random initialization on the runtime of randomized search heuristics
From MaRDI portal
Publication:306492
DOI10.1007/s00453-015-0019-5zbMath1348.68226OpenAlexW1170402926MaRDI QIDQ306492
Publication date: 31 August 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0019-5
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items
The impact of random initialization on the runtime of randomized search heuristics ⋮ Fixed-target runtime analysis ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Lower bounds from fitness levels made easy ⋮ Runtime analysis of evolutionary algorithms via symmetry arguments ⋮ Stagnation detection with randomized local search ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ Optimal parameter choices via precise black-box analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The impact of random initialization on the runtime of randomized search heuristics
- The analysis of Quicksort programs
- Multiplicative drift analysis
- Black-box search by unbiased variation
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- Combinatorial sums and finite differences
- Comparing evolutionary algorithms to the (\(1+1\))-EA
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
- Probability and Computing
- Drift analysis and average time complexity of evolutionary algorithms
This page was built for publication: The impact of random initialization on the runtime of randomized search heuristics
