Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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: OAT S15/S16/S17
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].
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login