4 papers
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…
Analysis of a Gray-Box Operator for Vertex Cover
Samuel Baguley, Tobias Friedrich, Timo Kötzing +3
Combinatorial optimization problems are a prominent application area of evolutionary algorithms, where the (1+1) EA is one of the most investigated. We extend this algorithm by int…
First-Hitting Times Under Additive Drift
Timo Kötzing, Martin S. Krejca
For the last ten years, almost every theoretical result concerning the expected run time of a randomized search heuristic used drift theory, making it the arguably most important t…