22 citations · 84 across the 31 of their papers we have counts for
4 papers · 1 filter
Analysis of the survival time of the SIRS process via expansion
Tobias Friedrich, Andreas Göbel, Nicolas Klodt +2
We study the SIRS process, a continuous-time Markov chain modeling the spread of infections on graphs. In this model, vertices are either susceptible, infected, or recovered. Each…
Run Time Analysis for Random Local Search on Generalized Majority Functions
Carola Doerr, Martin S. Krejca
Run time analysis of evolutionary algorithms recently makes significant progress in linking algorithm performance to algorithm parameters. However, settings that study the impact o…
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann +2
We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an appro…
Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration
André Biedenkapp, Nguyen Dang, Martin S. Krejca +2
It has long been observed that the performance of evolutionary algorithms and other randomized search heuristics can benefit from a non-static choice of the parameters that steer t…