2 citations · 3 across the 5 of their papers we have counts for
5 papers
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover
Tobias Friedrich, Timo Kötzing, Markus Wagner
A common strategy for improving optimization algorithms is to restart the algorithm when it is believed to be trapped in an inferior part of the search space. However, while specif…
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity
Duc-Cuong Dang, Tobias Friedrich, Timo Kötzing +5
Population diversity is essential for avoiding premature convergence in Genetic Algorithms (GAs) and for the effective use of crossover. Yet the dynamics of how diversity emerges i…
A Map of Update Constraints in Inductive Inference
Timo Kötzing, Raphaela Palenta
We investigate how different learning restrictions reduce learning power and how the different restrictions relate to one another. We give a complete map for nine different restric…
Unbiased Black-Box Complexities of Jump Functions
Benjamin Doerr, Carola Doerr, Timo Kötzing
We analyze the unbiased black-box complexity of jump functions with small, medium, and large sizes of the fitness plateau surrounding the optimal solution. Among other results, we…
Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions
Timo Kötzing, Frank Neumann, Dirk Sudholt +1
With this paper, we contribute to the understanding of ant colony optimization (ACO) algorithms by formally analyzing their runtime behavior. We study simple MAX-MIN ant systems on…