35 citations · 53 across the 4 of their papers we have counts for
4 papers
Edge-matching Problems with Rotations
Martin Ebbesen, Paul Fischer, Carsten Witt
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a boa…
On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling
Frank Neumann, Carsten Witt
Evolutionary algorithms have been frequently used for dynamic optimization problems. With this paper, we contribute to the theoretical understanding of this research area. We prese…
Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Pietro S. Oliveto, Carsten Witt
This erratum points out an error in the simplified drift theorem (SDT) [Algorithmica 59(3), 369-386, 2011]. It is also shown that a minor modification of one of its conditions is s…
Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation
Per Kristian Lehre, Carsten Witt
We reconsider stochastic convergence analyses of particle swarm optimisation, and point out that previously obtained parameter conditions are not always sufficient to guarantee mea…