37 citations · 140 across the 33 of their papers we have counts for
3 papers · 1 filter
Fast Perturbative Algorithm Configurators
George T. Hall, Pietro Simone Oliveto, Dirk Sudholt
Recent work has shown that the ParamRLS and ParamILS algorithm configurators can tune some simple randomised search heuristics for standard benchmark functions in linear expected t…
More Effective Randomized Search Heuristics for Graph Coloring Through Dynamic Optimization
Jakob Bossek, Frank Neumann, Pan Peng +1
Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that…
Analysis of the Performance of Algorithm Configurators for Search Heuristics with Global Mutation Operators
George T. Hall, Pietro Simone Oliveto, Dirk Sudholt
Recently it has been proved that a simple algorithm configurator called ParamRLS can efficiently identify the optimal neighbourhood size to be used by stochastic local search to op…