(1+1) EA on Generalized Dynamic OneMax
From MaRDI portal
Publication:2981881
DOI10.1145/2725494.2725502zbMath1361.68201OpenAlexW1985910644WikidataQ57200572 ScholiaQ57200572MaRDI QIDQ2981881
Carsten Witt, Timo Kötzing, Andrei Lissovoi
Publication date: 10 May 2017
Published in: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII (Search for Journal in Brave)
Full work available at URL: https://orbit.dtu.dk/en/publications/54479c6c-a7af-4fe0-afbc-d9b70b62c2d8
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A runtime analysis of parallel evolutionary algorithms in dynamic optimization, Populations can be essential in tracking dynamic optima, Result diversification by multi-objective evolutionary algorithms with theoretical guarantees, Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem, Runtime analysis for self-adaptive mutation rates, Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints, Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem, First Steps Towards a Runtime Analysis of Neuroevolution, Runtime Analysis of a Co-Evolutionary Algorithm, More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments, The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate, Sorting by swaps with noisy comparisons, Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints, Runtime analysis of the \((\mu + 1)\)-EA on the dynamic BinVal function, Multiplicative up-drift, The impact of a sparse migration topology on the runtime of island models in dynamic optimization, Static and self-adjusting mutation strengths for multi-valued decision variables, Running time analysis of the (1+1)-EA for robust linear optimization
Cites Work
