research
∙
07/21/2023
Run Time Bounds for Integer-Valued OneMax Functions
While most theoretical run time analyses of discrete randomized search h...
share
research
∙
05/29/2023
Analysis of the (1+1) EA on LeadingOnes with Constraints
Understanding how evolutionary algorithms perform on constrained problem...
research
∙
11/24/2022
Theoretical Study of Optimizing Rugged Landscapes with the cGA
Estimation of distribution algorithms (EDAs) provide a distribution - ba...
research
∙
04/07/2021
Lower Bounds from Fitness Levels Made Easy
One of the first and easy to use techniques for proving run time bounds ...
research
∙
10/15/2020
Learning Languages with Decidable Hypotheses
In language learning in the limit, the most common type of hypothesis is...
research
∙
10/09/2020
Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes
We investigate learning collections of languages from texts by an induct...
research
∙
10/07/2020
Learning Half-Spaces and other Concept Classes in the Limit with Iterative Learners
In order to model an efficient learning paradigm, iterative learning alg...
research
∙
06/12/2020
Improved Fixed-Budget Results via Drift Analysis
Fixed-budget theory is concerned with computing or bounding the fitness ...
research
∙
04/11/2019
Multiplicative Up-Drift
Drift analysis aims at translating the expected progress of an evolution...
research
∙
06/06/2018
Bounding Bloat in Genetic Programming
While many optimization problems work with a fixed number of decision va...
research
∙
06/04/2018
Ring Migration Topology Helps Bypassing Local Optima
Running several evolutionary algorithms in parallel and occasionally exc...
research
∙
05/25/2018
Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming
For theoretical analyses there are two specifics distinguishing GP from ...
research
∙
05/22/2018
Intuitive Analyses via Drift Theory
Humans are bad with probabilities, and the analysis of randomized algori...
research
∙
05/22/2018
First-Hitting Times Under Additive Drift
For the last ten years, almost every theoretical result concerning the e...
research
∙
01/31/2018
Learning Families of Formal Languages from Positive and Negative Information
For 50 years, research in the area of inductive inference aims at invest...
research
∙
09/13/2016
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover
A common strategy for improving optimization algorithms is to restart th...
research
∙
08/10/2016
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity
Population diversity is essential for avoiding premature convergence in ...
research
∙
04/12/2016
The Right Mutation Strength for Multi-Valued Decision Variables
The most common representation in evolutionary computation are bit strin...
research
∙
06/19/2015
Solving Problems with Unknown Solution Length at (Almost) No Extra Cost
Most research in the theory of evolutionary computation assumes that the...
research
∙
02/10/2015
The Benefit of Sex in Noisy Evolutionary Search
The benefit of sexual recombination is one of the most fundamental quest...
research
∙
03/30/2014
Unbiased Black-Box Complexities of Jump Functions
We analyze the unbiased black-box complexity of jump functions with smal...
research
∙
07/02/2012
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem ...
research
∙
08/01/2011
Black-Box Complexities of Combinatorial Problems
Black-box complexity is a complexity theoretic measure for how difficult...
research
∙
12/04/2010
Faster Black-Box Algorithms Through Higher Arity Operators
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-...
research
∙
07/27/2010
