Fourier analysis meets runtime analysis: precise runtimes on plateaus

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Robustness of populations in stochastic environments
Crossover can provably be useful in evolutionary computation
Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
Analyzing evolutionary algorithms. The computer science perspective.
Runtime analysis of the 1-ANT ant colony optimizer
Simplified drift analysis for proving lower bounds in evolutionary computation
Plateaus can be harder in multi-objective optimization
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Comparison of simple diversity mechanisms on plateau functions
On the analysis of the \((1+1)\) evolutionary algorithm
Level-based analysis of the univariate marginal distribution algorithm
Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise
The query complexity of a permutation-based variant of mastermind
The analysis of evolutionary algorithms on sorting and shortest paths problems
Adaptive drift analysis
Multiplicative drift analysis
Fixed-target runtime analysis
Exponential upper bounds for the runtime of randomized search heuristics
Multiplicative up-drift
The runtime of the compact genetic algorithm on jump functions
Self-adjusting mutation rates with provably optimal success rules
Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes
Performance analysis of randomised search heuristics operating with a fixed budget
Fitness levels with tail bounds for the analysis of randomized search heuristics
Analyzing randomized search heuristics via stochastic domination
Upper and lower bounds for randomized search heuristics in black-box optimization
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial
On non-elitist evolutionary algorithms optimizing fitness functions with a plateau
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
On the Black-Box Complexity of Example Functions
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help
A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones
Equation of State Calculations by Fast Computing Machines
Evolutionary Learning: Advances in Theories and Algorithms
Theory of Evolutionary Computation
Tail bounds on hitting times of randomized search heuristics using variable drift analysis
Optimizing epochal evolutionary search: Population-size dependent theory

This page was built for publication: Fourier analysis meets runtime analysis: precise runtimes on plateaus