5 citations · 9 across the 12 of their papers we have counts for
8 papers · 1 filter
Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring
Johanna Gasse, Antonia Heinen, Felix Knöfel +2
We analyze the two combinatorial problems of Dominating Set and Vertex Coloring regarding what kind of local optima are present for various instances. For a variety of graph classe…
Gray-Box Optimization and the Vertex Coloring Problem
Johanna Gasse, Antonia Heinen, Hendrik Higl +1
Gray-box optimization is an approach for making some problem-specific information available to the algorithm while still relying on fitness information as the main guide to an opti…
Analysis of Search Heuristics in the Multi-Armed Bandit Setting
Jasmin Brandt, Barbara Hammer, Timo Kötzing +1
We consider the classic Multi-Armed Bandit setting to understand the exploration/exploitation tradeoffs made by different search heuristics. Since many search heuristics work by co…
Anytime Analysis on BinVal: Adaptive Parameters Help
Timo Kötzing, Jurek Sander
While most theoretical run time analyses of discrete randomized search heuristics provide bounds on the expected number of evaluations to find the global optimum, we consider the a…
Run Time Bounds for Integer-Valued OneMax Functions
Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li +1
While most theoretical run time analyses of discrete randomized search heuristics focused on finite search spaces, we consider the search space . This is a further ge…
Analysis of the (1+1) EA on LeadingOnes with Constraints
Tobias Friedrich, Timo Kötzing, Aneta Neumann +2
Understanding how evolutionary algorithms perform on constrained problems has gained increasing attention in recent years. In this paper, we study how evolutionary algorithms optim…
ELEA -- Build your own Evolutionary Algorithm in your Browser
Markus Wagner, Erik Kohlros, Gerome Quantmeyer +1
We provide an open source framework to experiment with evolutionary algorithms which we call "Experimenting and Learning toolkit for Evolutionary Algorithms (ELEA)". ELEA is browse…
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…