Carsten Witt

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

The compact genetic algorithm struggles on Cliff functions.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9, 2022

2021

On Steady-State Evolutionary Algorithms and Selective Pressure: Why Inverse Rank-Based Allocation of Reproductive Trials Is Best.

[BibT_eX]

[DOI]

ACM Trans. Evol. Learn. Optim., 2021

Tail bounds on hitting times of randomized search heuristics using variable drift analysis.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs.

[BibT_eX]

[DOI]

Andrew M. Sutton

Algorithmica, 2021

Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint.

[BibT_eX]

[DOI]

Mojgan Pourhassan

Algorithmica, 2021

The Complex Parameter Landscape of the Compact Genetic Algorithm.

[BibT_eX]

[DOI]

Johannes Lengler

Algorithmica, 2021

Runtime Analysis for Self-adaptive Mutation Rates.

[BibT_eX]

[DOI]

Jing Yang

Algorithmica, 2021

Stagnation detection in highly multimodal fitness landscapes.

[BibT_eX]

[DOI]

Amirhossein Rajabi

Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms.

[BibT_eX]

[DOI]

Proceedings of the FOGA '21: Foundations of Genetic Algorithms XVI, 2021

2020

Theory of Estimation-of-Distribution Algorithms.

[BibT_eX]

[DOI]

Martin S. Krejca

Proceedings of the Theory of Evolutionary Computation, 2020

Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax.

[BibT_eX]

[DOI]

Martin S. Krejca

Theor. Comput. Sci., 2020

Evolutionary Algorithms with Self-adjusting Asymmetric Mutation.

[BibT_eX]

[DOI]

Amirhossein Rajabi

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Improved Fixed-Budget Results via Drift Analysis.

[BibT_eX]

[DOI]

Timo Kötzing

Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

Theory of estimation-of-distribution algorithms.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

A tight lower bound on the expected runtime of standard steady state genetic algorithms.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019

Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax.

[BibT_eX]

[DOI]

Algorithmica, 2019

On the Choice of the Update Strength in Estimation-of-Distribution Algorithms and Ant Colony Optimization.

[BibT_eX]

[DOI]

Algorithmica, 2019

The (1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate.

[BibT_eX]

[DOI]

Algorithmica, 2019

Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools.

[BibT_eX]

[DOI]

Hsien-Kuei Hwang

Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019

2018

Theory of Estimation-of-Distribution Algorithms.

[BibT_eX]

[DOI]

Martin S. Krejca

CoRR, 2018

The Impact of a Sparse Migration Topology on the Runtime of Island Models in Dynamic Optimization.

[BibT_eX]

[DOI]

Algorithmica, 2018

Optimal Mutation Rates for the (1+λ) EA on OneMax Through Asymptotically Tight Drift Analysis.

[BibT_eX]

[DOI]

Algorithmica, 2018

Domino convergence: why one should hill-climb on linear functions.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

Medium step sizes are harmful for the compact genetic algorithm.

[BibT_eX]

[DOI]

Johannes Lengler

Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017

Detecting structural breaks in time series via genetic algorithms.

[BibT_eX]

[DOI]

Soft Comput., 2017

A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization.

[BibT_eX]

[DOI]

Algorithmica, 2017

The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax.

[BibT_eX]

[DOI]

Algorithmica, 2017

Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

The (1+<i>λ</i>) evolutionary algorithm with self-adjusting mutation rate.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

2016

MMAS Versus Population-Based EA on a Family of Dynamic Fitness Functions.

[BibT_eX]

[DOI]

Algorithmica, 2016

Guest Editorial: Theory of Evolutionary Computation.

[BibT_eX]

[DOI]

Algorithmica, 2016

Update Strength in EDAs and ACO: How to Avoid Genetic Drift.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

The Impact of Migration Topology on the Runtime of Island Models in Dynamic Optimization.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Optimal Mutation Rates for the (1+λ) EA on OneMax.

[BibT_eX]

[DOI]

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

2015

Improved time complexity analysis of the Simple Genetic Algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Runtime analysis of ant colony optimization on dynamic shortest path problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Utility of Island Models in Dynamic Optimization.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Population Size vs. Mutation Strength for the (1+λ) EA on OneMax.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

(1+1) EA on Generalized Dynamic OneMax.

[BibT_eX]

[DOI]

Timo Kötzing

Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015

2014

On the runtime analysis of the Simple Genetic Algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Fitness levels with tail bounds for the analysis of randomized search heuristics.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

Revised analysis of the (1+1) ea for the minimum spanning tree problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

MMAS vs. population-based EA on a family of dynamic fitness functions.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013

Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2013

The Fitness Level Method with Tail Bounds.

[BibT_eX]

[DOI]

CoRR, 2013

General Drift Analysis with Tail Bounds.

[BibT_eX]

[DOI]

CoRR, 2013

Improved runtime analysis of the simple genetic algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

A method to derive fixed budget results from expected optimisation times.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Evolutionary algorithms for the detection of structural breaks in time series: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

When do evolutionary algorithms optimize separable functions in parallel?

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms XII, 2013

2012

Analysis of an iterated local search algorithm for vertex cover in sparse random graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Theoretical analysis of two ACO approaches for the traveling salesman problem.

[BibT_eX]

[DOI]

Swarm Intell., 2012

Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation.

[BibT_eX]

[DOI]

CoRR, 2012

Black-Box Search by Unbiased Variation.

[BibT_eX]

[DOI]

Algorithmica, 2012

Theory of Randomized Search Heuristics.

[BibT_eX]

[DOI]

Anne Auger

Algorithmica, 2012

Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

On the analysis of the simple genetic algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011

Runtime analysis of the 1-ANT ant colony optimizer.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Tight Bounds on the Optimization Time of the (1+1) EA on Linear Functions

[BibT_eX]

[DOI]

CoRR, 2011

Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation

[BibT_eX]

[DOI]

CoRR, 2011

Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation.

[BibT_eX]

[DOI]

Algorithmica, 2011

Theory of randomized search heuristics in combinatorial optimization.

[BibT_eX]

[DOI]

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Sharp bounds by probability-generating functions and variable drift.

[BibT_eX]

[DOI]

Mahmoud Fouz

Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Edge-Matching Problems with Rotations.

[BibT_eX]

[DOI]

Martin Ebbesen

Paul Fischer

Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Theory of Particle Swarm Optimization.

[BibT_eX]

[DOI]

Proceedings of the Theory of Randomized Search Heuristics: Foundations and Recent Developments., 2011

2010

Runtime analysis of a binary particle swarm optimizer.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Ant Colony Optimization and the minimum spanning tree problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models.

[BibT_eX]

[DOI]

Evol. Comput., 2010

Theory of randomised search heuristics in combinatorial optimisation.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

A few ants are enough: ACO with iteration-best update.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Quasirandom evolutionary algorithms.

[BibT_eX]

[DOI]

Mahmoud Fouz

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

10361 Abstracts Collection and Executive Summary - Theory of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Algorithms, 05.09. - 10.09.2010, 2010

Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem.

[BibT_eX]

[DOI]

Proceedings of the Swarm Intelligence - 7th International Conference, 2010

Bioinspired Computation in Combinatorial Optimization

[BibT_eX]

[DOI]

Natural Computing Series, Springer, ISBN: 978-3-642-16543-6, 2010

2009

Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Swarm Intelligence, 2009

Analysis of different MMAS ACO algorithms on unimodal functions and plateaus.

[BibT_eX]

[DOI]

Swarm Intell., 2009

Ingo Wegener.

[BibT_eX]

[DOI]

Evol. Comput., 2009

Analysis of Diversity-Preserving Mechanisms for Global Exploration.

[BibT_eX]

[DOI]

Evol. Comput., 2009

Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem.

[BibT_eX]

[DOI]

Evol. Comput., 2009

Runtime Analysis of a Simple Ant Colony Optimization Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 2009

Greedy Local Search and Vertex Cover in Sparse Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Theory of randomised search heuristics in combinatorial optimisation: an algorithmic point of view.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Theoretical analysis of fitness-proportional selection: landscapes and efficiency.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

Why standard particle swarm optimisers elude a theoretical runtime analysis.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms, 2009

2008

Population size versus runtime of a simple evolutionary algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Theoretical analysis of diversity mechanisms for global exploration.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2008

Runtime Analysis of Binary PSO.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Algorithms, 27.01. - 01.02.2008, 2008

08051 Abstracts Collection - Theory of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Algorithms, 27.01. - 01.02.2008, 2008

08051 Executive Summary - Theory of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Algorithms, 27.01. - 01.02.2008, 2008

Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search.

[BibT_eX]

[DOI]

Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2008

2007

Collaborative Research Centre 531: Computational Intelligence - Theory and Practice (Sonderforschungsbereich 531: Computational Intelligence - Theorie und Praxis).

[BibT_eX]

[DOI]

Jörn Mehnen

Thomas Michelitsch

it Inf. Technol., 2007

A Note on Problem Difficulty Measures in Black-Box Optimization: Classification, Realizations and Predictability.

[BibT_eX]

[DOI]

Evol. Comput., 2007

Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007

On the runtime analysis of the 1-ANT ACO algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

On improving approximate solutions by evolutionary algorithms.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2007

2006

Runtime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions.

[BibT_eX]

[DOI]

Evol. Comput., 2006

2005

On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions.

[BibT_eX]

[DOI]

Ingo Wegener

J. Discrete Algorithms, 2005

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics.

[BibT_eX]

[DOI]

Ingo Wegener

Comb. Probab. Comput., 2005

Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Rigorous runtime analysis of a (µ+1)ES for the sphere function.

[BibT_eX]

[DOI]

Jens Jägersküpper

Proceedings of the Genetic and Evolutionary Computation Conference, 2005

2004

Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung.

[BibT_eX]

[DOI]

PhD thesis, 2004

Über die Analyse randomisierter Suchheuristiken und den Entwurf spezialisierter Algorithmen im Bereich der kombinatorischen Optimierung.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2004, 2004

An Analysis of the (µ+1) EA on Simple Pseudo-Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation, 2004

2003

On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search.

[BibT_eX]

[DOI]

Ingo Wegener

Proceedings of the Genetic and Evolutionary Computation, 2003

Population size vs. runtime of a simple EA.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2003

2001

Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows.

[BibT_eX]

[DOI]

Susanne Albers