Runtime Analysis for Self-adaptive Mutation Rates
Authors:
- 12 June 2020
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 83 (4) , 1012-1053
Abstract
No abstract availableKeywords
Funding Information
- Investissement d’Avenir (ANR-11-LABX-0056-LMH)
- Cost association (CA15140)
This publication has 52 references indexed in Scilit:
- Mutation Rate Matters Even When Optimizing Monotonic FunctionsEvolutionary Computation, 2013
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear FunctionsCombinatorics, Probability and Computing, 2013
- Multiplicative Drift AnalysisAlgorithmica, 2012
- Adaptive Drift AnalysisAlgorithmica, 2011
- Combining Markov-Chain Analysis and Drift AnalysisAlgorithmica, 2010
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of linksInternational Journal of Intelligent Computing and Cybernetics, 2009
- On the Choice of the Offspring Population Size in Evolutionary AlgorithmsEvolutionary Computation, 2005
- On the analysis of a dynamic evolutionary algorithmJournal of Discrete Algorithms, 2005
- On the analysis of the (1+1) evolutionary algorithmTheoretical Computer Science, 2002
- Hitting-time and occupation-time bounds implied by drift analysis with applicationsAdvances in Applied Probability, 1982