Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Wednesday, September 16, 2009, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Per Kristian Lehre (Univ. of Birmingham, UK)
The progress in runtime analysis of evolutionary algorithms (EAs) over the last decade has been significant. However, the analysis is still limited to rather simple EAs that do not use a parent population. More sophisticated techniques are needed to extend the results to population-based EAs. This talk will first give a brief introduction to runtime analysis of single-individual based EAs. Then, we will discuss ways of extending runtime analysis to population-based EAs. In particular, we will describe a new technique called non-selective family trees that is based on branching processes. To demonstrate the new technique, we will apply it to study the impact of the mutation-selection balance on the runtime of a non-elitistic population-based EA that uses linear ranking selection.
Some of the results have been published in Lehre & Yao (FOGA, 2009): [pdf].
Automatic MiSe System Software Version 1.4803M | admin login