Parallel Black-Box Complexity with Tail Bounds

31 January 2019

Papers citing "Parallel Black-Box Complexity with Tail Bounds"

6 / 6 papers shown

Title
Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima J. Jorritsma Johannes Lengler Dirk Sudholt 61 15 0 19 Apr 2023
Hard Problems are Easier for Success-based Parameter Control Mario Alejandro Hevia Fajardo Dirk Sudholt 56 6 0 12 Apr 2022
Choosing the Right Algorithm With Hints From Complexity Theory Shouda Wang Weijie Zheng Benjamin Doerr 127 17 0 14 Sep 2021
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms Kirill Antonov M. Buzdalov Arina Buzdalova Carola Doerr 61 4 0 23 Feb 2021
Fast Mutation in Crossover-based Algorithms Denis Antipov M. Buzdalov Benjamin Doerr 55 36 0 14 Apr 2020
On the Impact of the Cutoff Time on the Performance of Algorithm Configurators George T. Hall P. S. Oliveto Dirk Sudholt 64 12 0 12 Apr 2019