ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2304.09712
  4. Cited By
Comma Selection Outperforms Plus Selection on OneMax with Randomly
  Planted Optima

Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima

19 April 2023
J. Jorritsma
Johannes Lengler
Dirk Sudholt
ArXivPDFHTML

Papers citing "Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima"

13 / 13 papers shown
Title
EvoPress: Towards Optimal Dynamic Model Compression via Evolutionary
  Search
EvoPress: Towards Optimal Dynamic Model Compression via Evolutionary Search
Oliver Sieberling
Denis Kuznedelev
Eldar Kurtic
Dan Alistarh
MQ
26
5
0
18 Oct 2024
How Population Diversity Influences the Efficiency of Crossover
How Population Diversity Influences the Efficiency of Crossover
Sacha Cerf
Johannes Lengler
24
0
0
18 Apr 2024
Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes
Self-Adjusting Evolutionary Algorithms Are Slow on Multimodal Landscapes
Johannes Lengler
Konstantin Sturm
14
0
0
18 Apr 2024
Plus Strategies are Exponentially Slower for Planted Optima of Random
  Height
Plus Strategies are Exponentially Slower for Planted Optima of Random Height
Johannes Lengler
Leon Schiller
Oliver Sieberling
24
2
0
15 Apr 2024
Already Moderate Population Sizes Provably Yield Strong Robustness to
  Noise
Already Moderate Population Sizes Provably Yield Strong Robustness to Noise
Denis Antipov
Benjamin Doerr
A. Ivanova
39
2
0
02 Apr 2024
Hardest Monotone Functions for Evolutionary Algorithms
Hardest Monotone Functions for Evolutionary Algorithms
Marc Kaufmann
Maxime Larcher
Johannes Lengler
Oliver Sieberling
25
2
0
13 Nov 2023
Analysing the Robustness of NSGA-II under Noise
Analysing the Robustness of NSGA-II under Noise
D. Dang
Andre Opris
B. Salehi
Dirk Sudholt
28
23
0
07 Jun 2023
How Well Does the Metropolis Algorithm Cope With Local Optima?
How Well Does the Metropolis Algorithm Cope With Local Optima?
Benjamin Doerr
Taha El Ghazi El Houssaini
A. Rajabi
Carsten Wit
21
6
0
21 Apr 2023
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic
  Differences Between Jumps and Cliffs
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
Benjamin Doerr
Arthur Dremaux
J. Lutzeyer
Aurélien Stumpf
20
5
0
20 Apr 2023
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms
  on Linear Functions
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
Carola Doerr
D. Janett
Johannes Lengler
30
1
0
23 Feb 2023
Self-adjusting Population Sizes for the $(1, λ)$-EA on Monotone
  Functions
Self-adjusting Population Sizes for the (1,λ)(1, λ)(1,λ)-EA on Monotone Functions
Marc Kaufmann
Maxime Larcher
Johannes Lengler
Xun Zou
9
9
0
01 Apr 2022
Choosing the Right Algorithm With Hints From Complexity Theory
Choosing the Right Algorithm With Hints From Complexity Theory
Shouda Wang
Weijie Zheng
Benjamin Doerr
11
17
0
14 Sep 2021
Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms:
  Why Success Rates Matter
Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates Matter
Mario Alejandro Hevia Fajardo
Dirk Sudholt
8
18
0
12 Apr 2021
1