Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1504.06260
Cited By
v1
v2 (latest)
First Steps Towards a Runtime Comparison of Natural and Artificial Evolution
23 April 2015
T. Paixão
J. Heredia
Dirk Sudholt
Barbora Trubenová
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"First Steps Towards a Runtime Comparison of Natural and Artificial Evolution"
20 / 20 papers shown
Hyper-Heuristics Can Profit From Global Variation Operators
Benjamin Doerr
J. Lutzeyer
215
3
0
19 Jul 2024
How Well Does the Metropolis Algorithm Cope With Local Optima?
Annual Conference on Genetic and Evolutionary Computation (GECCO), 2023
Benjamin Doerr
Taha El Ghazi El Houssaini
A. Rajabi
Carsten Wit
487
7
0
21 Apr 2023
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
Annual Conference on Genetic and Evolutionary Computation (GECCO), 2023
Benjamin Doerr
Arthur Dremaux
J. Lutzeyer
Aurélien Stumpf
379
8
0
20 Apr 2023
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima
Annual Conference on Genetic and Evolutionary Computation (GECCO), 2023
J. Jorritsma
Johannes Lengler
Dirk Sudholt
220
15
0
19 Apr 2023
Hard Problems are Easier for Success-based Parameter Control
Annual Conference on Genetic and Evolutionary Computation (GECCO), 2022
Mario Alejandro Hevia Fajardo
Dirk Sudholt
255
6
0
12 Apr 2022
Choosing the Right Algorithm With Hints From Complexity Theory
Shouda Wang
Weijie Zheng
Benjamin Doerr
498
20
0
14 Sep 2021
An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
Henry Bambury
Antoine Bultel
Benjamin Doerr
422
13
0
07 May 2021
When Non-Elitism Meets Time-Linkage Problems
Annual Conference on Genetic and Evolutionary Computation (GECCO), 2021
Weijie Zheng
Qiaozhi Zhang
Huanhuan Chen
Xin Yao
196
8
0
14 Apr 2021
Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates Matter
Annual Conference on Genetic and Evolutionary Computation (GECCO), 2021
Mario Alejandro Hevia Fajardo
Dirk Sudholt
330
23
0
12 Apr 2021
Fast Immune System Inspired Hypermutation Operators for Combinatorial Optimisation
IEEE Transactions on Evolutionary Computation (TEVC), 2020
Dogan Corus
P. S. Oliveto
Donya Yazdani
162
11
0
01 Sep 2020
Exponential Upper Bounds for the Runtime of Randomized Search Heuristics
Parallel Problem Solving from Nature (PPSN), 2020
Benjamin Doerr
417
11
0
13 Apr 2020
Does Comma Selection Help To Cope With Local Optima
Benjamin Doerr
322
56
0
02 Apr 2020
Parallel Black-Box Complexity with Tail Bounds
IEEE Transactions on Evolutionary Computation (TEVC), 2019
Per Kristian Lehre
Dirk Sudholt
222
17
0
31 Jan 2019
Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial
Dirk Sudholt
167
28
0
03 Dec 2018
Fast Artificial Immune Systems
Dogan Corus
P. S. Oliveto
Donya Yazdani
170
28
0
01 Jun 2018
Memetic Algorithms Beat Evolutionary Algorithms on the Class of Hurdle Problems
P. Nguyen
Dirk Sudholt
123
14
0
17 Apr 2018
When Hypermutations and Ageing Enable Artificial Immune Systems to Outperform Evolutionary Algorithms
Dogan Corus
P. S. Oliveto
Donya Yazdani
266
31
0
04 Apr 2018
Complexity Theory for Discrete Black-Box Optimization Heuristics
Carola Doerr
338
34
0
06 Jan 2018
Drift Analysis
Johannes Lengler
139
16
0
04 Dec 2017
How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms
Evolutionary Computation (Evol. Comput.), 2014
Dirk Sudholt
237
68
0
26 Mar 2014
1
Page 1 of 1
