Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions-Reference-Cited by-同舟云学术

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions

Published:2023-07-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference
language:
Short-container-title:

Author:

Doerr Carola¹²^ORCID,Janett Duri Andrea³⁴^ORCID,Lengler Johannes⁵^ORCID

Affiliation:

1. CNRS, Paris, France

2. Sorbonne Université, Paris, France

3. Department of Mathematics, ETH Zurich, Zürich, Switzerland

4. Sorbonne Université, Zürich, Switzerland

5. Department of Computer Science, ETH Zurich, Zürich, Switzerland

Funder

ERC

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3583131.3590482

Reference57 articles.

1. Lazy parameter tuning and control

2. Fast Mutation in Crossover-Based Algorithms

3. Denis Antipov and Benjamin Doerr . 2020 . Runtime analysis of a heavy-tailed (1 + (Λ, Λ)) genetic algorithm on jump functions. In Parallel Problem Solving from Nature-PPSN XVI: 16th International Conference , PPSN 2020, Leiden, The Netherlands, September 5--9, 2020, Proceedings, Part II. Springer, 545--559 . Denis Antipov and Benjamin Doerr. 2020. Runtime analysis of a heavy-tailed (1 + (Λ, Λ)) genetic algorithm on jump functions. In Parallel Problem Solving from Nature-PPSN XVI: 16th International Conference, PPSN 2020, Leiden, The Netherlands, September 5--9, 2020, Proceedings, Part II. Springer, 545--559.

4. Precise Runtime Analysis for Plateau Functions

5. The effect of non-symmetric fitness

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hardest Monotone Functions for Evolutionary Algorithms;Lecture Notes in Computer Science;2024