LZI - Schloss Dagstuhl - Talks + Materials of Seminar 08051

Collector buttons:

Seminar 08051
Theory of Evolutionary Algorithms

Dirk V. Arnold (Dalhousie University, CDN), Anne Auger (INRIA Futurs - Paris, FR), Carsten Witt (Universität Dortmund, D), Jonathan E. Rowe (University of Birmingham, GB)

Seminar Wide Materials

Theory of Evolutionary Algorithms - Executive Summary

Abstracts:

Paper:

DROPS-Submission:

	Upload or overwrite a document file and/or change title of talk


	Due to caching problems of microsofts internet explorer concerning dynamic webpages, sometimes newly uploaded files are not shown. By pressing [CTRL]+[F5], the page is completely reloaded.

Dirk V. Arnold , Dalhousie University

Step Length Adaptation on Ridge Functions

Abstracts:

Anne Auger , INRIA Futurs - Orsay

Thomas Bartz-Beielstein , FH Köln

Hans-Georg Beyer , Fachhochschule Vorarlberg

Yossi Borenstein , University of Essex

Kolmogorov Complexity and Hardness

Abstracts:

Jürgen Branke , Universität Karlsruhe

Evolutionary Multi-objective Worst Case Optimization

Abstracts:

Dimo Brockhoff , ETH Zürich

Anthony Bucci , Icosystem

Kenneth A. De Jong , George Mason Univ. - Fairfax

Benjamin Doerr , MPI für Informatik - Saarbrücken

A Non-artificial Problem Where Crossover Provably Helps

Abstracts:

Slides:

Anton Eremeev , Sobolev Institute of Mathematics - Omsk

NP-hard cases of optimal recombination

Abstracts:

Steffen Finck , Fachhochschule Vorarlberg

Performance of Evolution Strategies on PDQFs

Abstracts:

Olivier Francois , TIMC Laboratory

Evolution strategies with random numbers of offspring

Abstracts:

Tobias Friedrich , MPI für Informatik - Saarbrücken

Nikolaus Hansen , INRIA Futurs - Orsay

Toward a Convergence Proof for CMA-ES---and Beyond

Abstracts:

Slides:

Jun He , University of Birmingham

A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem

Abstracts:

DROPS-Submission:

Holger H. Hoos , University of British Columbia - Vancouver

Automated tuning, configuration and synthesis of complex stochastic local search algorithms

Abstracts:

Christian Igel , Ruhr-Universität Bochum

Efficient Covariance Matrix Update for Evolution Strategies

Abstracts:

Thomas Jansen , Technische Universität Dortmund

Bit Flip Mutations vs. Local Search: An Open Problem Presentation

Abstracts:

Jens Jägersküpper , Technische Universität Dortmund

William Langdon , University of Essex

A Field Guide to Genetic Programming

Abstracts:

Paper:

Other:

Nicholas Freitag McPhee , University of Minnesota - Morris

N-gram GP: Early results and half-baked ideas

Abstracts:

Slides:

DROPS-Submission:

Alexander Melkozerov , Fachhochschule Vorarlberg

Weighted Multirecombination Evolution Strategy with Mutation Strength Self-Adaptation on Quadratic Sphere

Abstracts:

Slides:

Silja Meyer-Nieberg , Univ. der Bundeswehr - München

Boris S. Mitavskiy , University of Sheffield

Estimating the Stationary Distributions of Markov Chains modeling Evolutionary Algorithms using quotient construction method

Abstracts:

Slides:

Paper:

DROPS-Submission:

Frank Neumann , MPI für Informatik - Saarbrücken

Making Problems Easier by Multi-Objective Optimization

Abstracts:

Pietro Oliveto , University of Birmingham

Riccardo Poli , University of Essex

Bye, Bye, Bloat

Abstracts:

Elena Popovici , Icosystem

Monotonic Convergence and Memory Requirements of Algorithms for "Interactive" Search Problems

Abstracts:

Adam Prügel-Bennett , Univ. of Southampton

Solving Problems with Critical Variables

Abstracts:

Slides:

Colin Reeves , Coventry University

Neal Richter , Montana State University - Bozeman

Jonathan E. Rowe , University of Birmingham

Representation-invariant crossover and mutation operators

Abstracts:

Günter Rudolph , Technische Universität Dortmund

Lothar M. Schmitt , The University of Aizu

Banach space techniques for the analysis of evolutionary algorithms

Abstracts:

Hans-Paul Schwefel , Technische Universität Dortmund

Jonathan L. Shapiro , Manchester University

Convergence in co-adapting agents with opponent modelling

Abstracts:

Dirk Sudholt , Technische Universität Dortmund

Runtime Analysis of Binary PSO

Abstracts:

Slides:

DROPS-Submission:

Olivier Teytaud , Université Paris Sud

Complexity lower bounds for evolution strategies (joint work with Hervé Fournier)

Abstracts:

Lothar Thiele , ETH Zürich

Ingo Wegener , Technische Universität Dortmund

Tight Bounds for Blind Search on the Integers

Abstracts:

L. Darrell Whitley , Colorado State University

Understanding Problem Structure and NFL

Abstracts:

R. Paul Wiegand , University of Central Florida, Orlando

Conditions for the Robustness of Compositional Coevolution

Abstracts:

Slides:

Carsten Witt , Technische Universität Dortmund

Alden Wright , Univ. of Montana - Missoula

Does a temporally or spatially varying environment speed up evolution?

Abstracts:

Xin Yao , University of Birmingham

Eckart Zitzler , ETH Zürich

Approximating the Pareto Set Using Set Preference Relations: A New Perspective On Evolutionary Multiobjective Optimization

Abstracts:

Copyright

This webpage and the material that is made available on this webpage is licensed under a
Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Unported License.

The CC by-nc-nd license allows you to copy, distribute and transmit the work under the following conditions:

Attribution: You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
Noncommercial: You may not use this work for commercial purposes.
No Derivative Works: You may not alter, transform, or build upon this work.

Seminar 08051 Theory of Evolutionary Algorithms

Copyright

Seminar 08051
Theory of Evolutionary Algorithms