Maximizing Drift is Not Optimal for Solving OneMax

v1v2 (latest)

Maximizing Drift is Not Optimal for Solving OneMax

16 April 2019

Nathan Buskulic

ArXiv (abs)PDF HTML

Papers citing "Maximizing Drift is Not Optimal for Solving OneMax"

7 / 7 papers shown

Title
Analysis and Optimization of Probabilities of Beneficial Mutation and Crossover Recombination in a Hamming Space Roman V. Belavkin 7 0 0 13 Jun 2025
Hardest Monotone Functions for Evolutionary Algorithms Marc Kaufmann Maxime Larcher Johannes Lengler Oliver Sieberling 57 2 0 13 Nov 2023
Using Automated Algorithm Configuration for Parameter Control D. Chen M. Buzdalov Carola Doerr Nguyen Dang 92 4 0 23 Feb 2023
Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration André Biedenkapp Nguyen Dang Martin S. Krejca Frank Hutter Carola Doerr 74 8 0 07 Feb 2022
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
Interpolating Local and Global Search by Controlling the Variance of Standard Bit Mutation Furong Ye Carola Doerr Thomas Bäck 64 24 0 17 Jan 2019

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.