pith. sign in

arxiv: 1712.00964 · v2 · pith:Q2BEP36Znew · submitted 2017-12-04 · 💻 cs.NE · math.PR

Drift Analysis

Johannes Lengler This is my paper
classification 💻 cs.NE math.PR
keywords analysisdriftalgorithmsevolutionarygiveanalysingchapterexamples
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Sharp Bounds on the Runtime of the (1+1) EA via Drift Analysis and Analytic Combinatorial Tools

    cs.NE 2019-06 conditional novelty 6.0

    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.