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.
Hitting-time and occupation-time bounds implied by drift anal- ysis with applications
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.