Erratum to: ``Drift analysis and average time complexity of evolutionary algorithms

DOI10.1016/S0004-3702(02)00260-6zbMath1052.68113OpenAlexW2142509348MaRDI QIDQ1614869

Jun He, Xin Yao

Publication date: 9 September 2002

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00260-6

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

Tail bounds on hitting times of randomized search heuristics using variable drift analysis ⋮ Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift ⋮ Adaptive drift analysis ⋮ Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded ⋮ Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances ⋮ Towards an analytic framework for analysing the computation time of evolutionary algorithms

Uses Software

• Genocop

Cites Work

• On the analysis of the \((1+1)\) evolutionary algorithm
• Drift analysis and average time complexity of evolutionary algorithms

This page was built for publication: Erratum to: ``Drift analysis and average time complexity of evolutionary algorithms