Thomas Jansen

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2024

2020

Analysing Stochastic Search Heuristics Operating on a Fixed Budget.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Computation, 2020

2019

Unlimited Budget Analysis of Randomised Search Heuristics.

[BibT_eX]

[DOI]

Jun He

CoRR, 2019

Unlimited budget analysis.

[BibT_eX]

[DOI]

Jun He

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018

Workshops at PPSN 2018.

[BibT_eX]

[DOI]

Robin C. Purshouse

Sylvain Cussat-Blanc

Michael G. Epitropakis

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

Theoretical Analysis of Lexicase Selection in Multi-objective Optimization.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XV, 2018

2017

Populations Can Be Essential in Tracking Dynamic Optima.

[BibT_eX]

[DOI]

Duc-Cuong Dang

Per Kristian Lehre

Algorithmica, 2017

On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

Example Landscapes to Support Analysis of Multimodal Optimisation.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature - PPSN XIV, 2016

2015

Genetic and Evolutionary Computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Analysis of Randomised Search Heuristics for Dynamic Optimisation.

[BibT_eX]

[DOI]

Evol. Comput., 2015

Populations can be Essential in Dynamic Optimisation.

[BibT_eX]

[DOI]

Duc-Cuong Dang

Per Kristian Lehre

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

On Easiest Functions for Somatic Contiguous Hypermutations And Standard Bit Mutations.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

On the Black-Box Complexity of Example Functions: The Real Jump Function.

[BibT_eX]

[DOI]

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

2014

Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Theory and Principled Methods for the Design of Metaheuristics, 2014

Transforming Evolutionary Search into Higher-Level Evolutionary Search by Capturing Problem Structure.

[BibT_eX]

[DOI]

Rob Mills

Richard A. Watson

IEEE Trans. Evol. Comput., 2014

Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2014

Performance analysis of randomised search heuristics operating with a fixed budget.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Evolutionary algorithms and artificial immune systems on a bi-stable dynamic optimisation problem.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013

Analyzing Evolutionary Algorithms - The Computer Science Perspective

[BibT_eX]

[DOI]

Natural Computing Series, Springer, ISBN: 978-3-642-17338-7, 2013

Mutation Rate Matters Even When Optimizing Monotonic Functions.

[BibT_eX]

[DOI]

Evol. Comput., 2013

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

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Approximating vertex cover using edge-based representations.

[BibT_eX]

[DOI]

Pietro S. Oliveto

Proceedings of the Foundations of Genetic Algorithms XII, 2013

2012

Computational Complexity of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Natural Computing, 2012

Computing Longest Common Subsequences with the B-Cell Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Artificial Immune Systems - 11th International Conference, 2012

Artificial immune systems for optimisation.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

Fixed budget computations: a different perspective on run time analysis.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2012

2011

On benefits and drawbacks of aging strategies for randomized search heuristics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Analyzing different variants of immune inspired somatic contiguous hypermutations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the role of age diversity for effective aging operators.

[BibT_eX]

[DOI]

Evol. Intell., 2011

Artificial Immune Systems (Dagstuhl Seminar 11172).

[BibT_eX]

[DOI]

Emma Hart

Jon Timmis

Dagstuhl Reports, 2011

Theory of Evolutionary Computation.

[BibT_eX]

[DOI]

Benjamin Doerr

Algorithmica, 2011

Variation in Artificial Immune Systems: Hypermutations with Mutation Potential.

[BibT_eX]

[DOI]

Proceedings of the Artificial Immune Systems - 10th International Conference, 2011

On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem.

[BibT_eX]

[DOI]

Pietro S. Oliveto

Proceedings of the Artificial Immune Systems - 10th International Conference, 2011

Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms, 11th International Workshop, 2011

Simulated Annealing.

[BibT_eX]

[DOI]

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

2010

Analysis of an Asymmetric Mutation Operator.

[BibT_eX]

[DOI]

Dirk Sudholt

Evol. Comput., 2010

Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization.

[BibT_eX]

[DOI]

Frank Neumann

Evol. Comput., 2010

Stability in the Self-Organized Evolution of Networks.

[BibT_eX]

[DOI]

Madeleine Theile

Algorithmica, 2010

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem.

[BibT_eX]

[DOI]

Dennis Weyland

Algorithmica, 2010

Optimizing Monotone Functions Can Be Difficult.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2010

On the Benefits of Aging and the Importance of Details.

[BibT_eX]

[DOI]

Proceedings of the Artificial Immune Systems, 9th International Conference, 2010

Aging beyond restarts.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Computational complexity and evolutionary computation.

[BibT_eX]

[DOI]

Frank Neumann

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

Incremental evolution of local search heuristics.

[BibT_eX]

[DOI]

Dara Curran

Eugene C. Freuder

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009

Ingo Wegener.

[BibT_eX]

[DOI]

Evol. Comput., 2009

Comparing Different Aging Operators.

[BibT_eX]

[DOI]

Proceedings of the Artificial Immune Systems, 8th International Conference, 2009

A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization.

[BibT_eX]

[DOI]

Proceedings of the Artificial Immune Systems, 8th International Conference, 2009

Maximal age in randomized search heuristics with aging.

[BibT_eX]

[DOI]

Christian Horoba

Proceedings of the Genetic and Evolutionary Computation Conference, 2009

2008

Comparing global and local mutations on bit strings.

[BibT_eX]

[DOI]

Benjamin Doerr

Christian Klein

Proceedings of the Genetic and Evolutionary Computation Conference, 2008

2007

A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

A building-block royal road where crossover is provably essential.

[BibT_eX]

[DOI]

Richard A. Watson

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

On the Brittleness of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms, 9th International Workshop, 2007

2006

On the analysis of a dynamic evolutionary algorithm.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

On the local performance of simulated annealing and the (1+1) evolutionary algorithm.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2006

06061 Abstracts Collection -- Theory of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Algorithms, 05.02. - 10.02.2006, 2006

06061 Executive Summary -- Theory of Evolutionary Algoritms.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Algorithms, 05.02. - 10.02.2006, 2006

2005

On the Choice of the Offspring Population Size in Evolutionary Algorithms.

[BibT_eX]

[DOI]

Kenneth A. De Jong

Evol. Comput., 2005

Real royal road functions--where crossover provably is essential.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice.

[BibT_eX]

[DOI]

Ulf Schellbach

Proceedings of the Genetic and Evolutionary Computation Conference, 2005

A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Genetic Algorithms, 8th International Workshop, 2005

Design and analysis of an asymmetric mutation operator.

[BibT_eX]

[DOI]

Dirk Sudholt

Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2004

The Cooperative Coevolutionary (1+1) EA.

[BibT_eX]

[DOI]

Evol. Comput., 2004

Bridging the Gap Between Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2004

The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2004

Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2004

04081 Abstracts Collection - Theory of Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Theory of Evolutionary Algorithms, 15.-20. February 2004, 2004

2003

Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Exploring the Explorative Advantage of the Cooperative Coevolutionary (1+1) EA.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation, 2003

Sequential versus parallel cooperative coevolutionary (1+1) EAs.

[BibT_eX]

[DOI]

Proceedings of the IEEE Congress on Evolutionary Computation, 2003

2002

Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

On the analysis of the (1+1) evolutionary algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.

[BibT_eX]

[DOI]

Algorithmica, 2002

On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2002

An Analysis Of The Role Of Offspring Population Size In EAs.

[BibT_eX]

Kenneth A. De Jong

Proceedings of the GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 2002

A New Framework for the Valuation of Algorithms for Black-Box Optimization.

[BibT_eX]

Proceedings of the Seventh Workshop on Foundations of Genetic Algorithms, 2002

2001

Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness.

[BibT_eX]

[DOI]

IEEE Trans. Evol. Comput., 2001

2000

On the Choice of the Mutation Probability for the (1+1) EA.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 2000

Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2000, 2000

Dynamic Parameter Control in Simple Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Sixth Workshop on Foundations of Genetic Algorithms, 2000

Theoretische Analyse evolutionärer Algorithmen unter dem Aspekt der Optimierung in diskreten Suchräumen.

[BibT_eX]

PhD thesis, 2000

1999

Perhaps Not a Free Lunch But At Least a Free Appetizer.

[BibT_eX]

Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

1998

A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs.

[BibT_eX]

[DOI]

Evol. Comput., 1998

On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 1998

1997

Introduction to the Theory of Complexity and Approximation Algorithms.

[BibT_eX]

[DOI]