
Lower Bounds from Fitness Levels Made Easy
One of the first and easy to use techniques for proving run time bounds ...
read it

Learning Languages with Decidable Hypotheses
In language learning in the limit, the most common type of hypothesis is...
read it

Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes
We investigate learning collections of languages from texts by an induct...
read it

Learning HalfSpaces and other Concept Classes in the Limit with Iterative Learners
In order to model an efficient learning paradigm, iterative learning alg...
read it

Improved FixedBudget Results via Drift Analysis
Fixedbudget theory is concerned with computing or bounding the fitness ...
read it

Multiplicative UpDrift
Drift analysis aims at translating the expected progress of an evolution...
read it

Bounding Bloat in Genetic Programming
While many optimization problems work with a fixed number of decision va...
read it

Ring Migration Topology Helps Bypassing Local Optima
Running several evolutionary algorithms in parallel and occasionally exc...
read it

Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming
For theoretical analyses there are two specifics distinguishing GP from ...
read it

Intuitive Analyses via Drift Theory
Humans are bad with probabilities, and the analysis of randomized algori...
read it

FirstHitting Times Under Additive Drift
For the last ten years, almost every theoretical result concerning the e...
read it

Learning Families of Formal Languages from Positive and Negative Information
For 50 years, research in the area of inductive inference aims at invest...
read it

A Generic Betandrun Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover
A common strategy for improving optimization algorithms is to restart th...
read it

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity
Population diversity is essential for avoiding premature convergence in ...
read it

The Right Mutation Strength for MultiValued Decision Variables
The most common representation in evolutionary computation are bit strin...
read it

Solving Problems with Unknown Solution Length at (Almost) No Extra Cost
Most research in the theory of evolutionary computation assumes that the...
read it

The Benefit of Sex in Noisy Evolutionary Search
The benefit of sexual recombination is one of the most fundamental quest...
read it

Unbiased BlackBox Complexities of Jump Functions
We analyze the unbiased blackbox complexity of jump functions with smal...
read it

More Effective Crossover Operators for the AllPairs Shortest Path Problem
The allpairs shortest path problem is the first nonartificial problem ...
read it

BlackBox Complexities of Combinatorial Problems
Blackbox complexity is a complexity theoretic measure for how difficult...
read it

Faster BlackBox Algorithms Through Higher Arity Operators
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black...
read it

Simple MaxMin Ant Systems and the Optimization of Linear PseudoBoolean Functions
With this paper, we contribute to the understanding of ant colony optimi...
read it