Drift analysis yields E(T) bounded between sum 1/Δ(k) minus c1 log n and sum 1/Δ(k) minus c2 log n, with the difference exactly (e/2) log n + O(1) for the (1+1) EA on OneMax from n/2 ones.
Drift Analysis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Drift analysis is one of the major tools for analysing evolutionary algorithms and nature-inspired search heuristics. In this chapter we give an introduction to drift analysis and give some examples of how to use it for the analysis of evolutionary algorithms.
fields
cs.NE 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools
Drift analysis yields E(T) bounded between sum 1/Δ(k) minus c1 log n and sum 1/Δ(k) minus c2 log n, with the difference exactly (e/2) log n + O(1) for the (1+1) EA on OneMax from n/2 ones.