65 citations · 151 across the 17 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.NE2021★ 10 cited
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution
Denis Antipov, Maxim Buzdalov, Benjamin Doerr
Most evolutionary algorithms have multiple parameters and their values drastically affect the performance. Due to the often complicated interplay of the parameters, setting these v…
cs.NE2021
Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms
Kirill Antonov, Maxim Buzdalov, Arina Buzdalova +1
With the goal to provide absolute lower bounds for the best possible running times that can be achieved by -type search heuristics on common benchmark problems, we recently…
cs.NE2021★ 5 cited
Optimal Static Mutation Strength Distributions for the Evolutionary Algorithm on OneMax
Maxim Buzdalov, Carola Doerr
Most evolutionary algorithms have parameters, which allow a great flexibility in controlling their behavior and adapting them to new problems. To achieve the best performance, it i…