Runtime Analysis of a Co-Evolutionary Algorithm
From MaRDI portal
Publication:6120969
Cites work
- (1+1) EA on Generalized Dynamic OneMax
- Concentration of first hitting times under additive drift
- Drift analysis and average time complexity of evolutionary algorithms
- First-hitting times under drift
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Multiplicative up-drift
- Probability and Computing
- Sampling biased monotonic surfaces using exponential metrics
- Tail bounds on hitting times of randomized search heuristics using variable drift analysis
- Theory of evolutionary computation. Recent developments in discrete optimization
- Upper and lower bounds for randomized search heuristics in black-box optimization
Cited in
(3)- Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function
- How fitness aggregation methods affect the performance of competitive CoEAs on bilinear problems
- A general upper bound for the runtime of a coevolutionary algorithm on impartial combinatorial games
This page was built for publication: Runtime Analysis of a Co-Evolutionary Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120969)