37 citations · 140 across the 33 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.NE2021
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
Jakob Bossek, Frank Neumann, Pan Peng +1
We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the…
cs.NE2021★ 2 cited
Self-Adjusting Population Sizes for Non-Elitist Evolutionary Algorithms: Why Success Rates Matter
Mario Alejandro Hevia Fajardo, Dirk Sudholt
Evolutionary algorithms (EAs) are general-purpose optimisers that come with several parameters like the sizes of parent and offspring populations or the mutation rate. It is well k…