Runtime Analysis of a Co-Evolutionary Algorithm: Overcoming Negative Drift in Maximin-Optimisation
Open Access
- 15 July 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 819-822
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function2022
- Coevolutionary generative adversarial networks for medical image augumentation at scale2022
- Sampling biased monotonic surfaces using exponential metricsCombinatorics, Probability and Computing, 2020
- Theory of Evolutionary Computation2020
- First-hitting times under driftTheoretical Computer Science, 2019
- Spatial evolutionary generative adversarial networks2019
- Concentration of First Hitting Times Under Additive DriftAlgorithmica, 2015
- Min–max and min–max regret versions of combinatorial optimization problems: A surveyEuropean Journal of Operational Research, 2009
- Drift analysis and average time complexity of evolutionary algorithmsArtificial Intelligence, 2001
- Co-evolving parasites improve simulated evolution as an optimization procedurePhysica D: Nonlinear Phenomena, 1990