8 citations · 8 across the 2 of their papers we have counts for
2 papers
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.NE2019★ 8 cited
Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates
Anna Rodionova, Kirill Antonov, Arina Buzdalova +1
We analyze the performance of the 2-rate Evolutionary Algorithm (EA) with self-adjusting mutation rate control, its 3-rate counterpart, and a ~EA variant using multi…