On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation

Analysis of Randomised Search Heuristics for Dynamic Optimisation

(2015) Thomas Jansen et al.   EVOLUTIONARY COMPUTATION

On the Easiest and Hardest Fitness Functions

(2015) Jun He et al.   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

From black-box complexity to designing new genetic algorithms

(2015) Benjamin Doerr et al.   THEORETICAL COMPUTER SCIENCE

Reevaluating Immune-Inspired Hypermutations Using the Fixed Budget Perspective

(2014) Thomas Jansen et al.   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

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

(2013) CARSTEN WITT   COMBINATORICS PROBABILITY & COMPUTING

Performance analysis of randomised search heuristics operating with a fixed budget

(2013) Thomas Jansen et al.   THEORETICAL COMPUTER SCIENCE

A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms

(2012) Dirk Sudholt   IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION

Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima

(2010) Dirk Sudholt   ALGORITHMICA

Analyzing different variants of immune inspired somatic contiguous hypermutations

(2010) Thomas Jansen et al.   THEORETICAL COMPUTER SCIENCE

The impact of parametrization in memetic evolutionary algorithms

(2009) Dirk Sudholt   THEORETICAL COMPUTER SCIENCE

Theoretical advances in artificial immune systems

(2008) J. Timmis et al.   THEORETICAL COMPUTER SCIENCE