The impact of random initialization on the runtime of randomized search heuristics
DOI10.1007/S00453-015-0019-5zbMATH Open1348.68226OpenAlexW1170402926MaRDI QIDQ306492FDOQ306492
Authors: Benjamin Doerr, Carola Doerr 
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
Recommendations
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- STACS 2005
- On the size of weights in randomized search heuristics
- Tight bounds on the optimization time of a randomized search heuristic on linear functions
- Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Analysis of algorithms (68W40)
Cites Work
- The analysis of Quicksort programs
- Black-box search by unbiased variation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability and Computing
- Analyzing randomized search heuristics: tools from probability theory
- Multiplicative drift analysis
- 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
- The impact of random initialization on the runtime of randomized search heuristics
- Title not available (Why is that?)
- 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
- Drift analysis and average time complexity of evolutionary algorithms
Cited In (10)
- Optimal parameter choices via precise black-box analysis
- Runtime analysis of evolutionary algorithms via symmetry arguments
- Static and self-adjusting mutation strengths for multi-valued decision variables
- The impact of random initialization on the runtime of randomized search heuristics
- Fixed-target runtime analysis
- Stagnation detection with randomized local search
- Lower bounds from fitness levels made easy
- Stagnation detection in highly multimodal fitness landscapes
- On the size of weights in randomized search heuristics
- Analyzing randomized search heuristics via stochastic domination
Uses Software
This page was built for publication: The impact of random initialization on the runtime of randomized search heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306492)
