Campus Event Calendar
Event Entry
What and Who
Analyses of Evolutionary Algorithms
Edda Happ
Max-Planck-Institut für Informatik - D1
Promotionskolloquium
AG 1, AG 4, RG1, MMCI, AG 3, AG 5, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 1 April 2009
14:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Evolutionary algorithms used in practice successfully apply both a crossover and a mutation operator to find good solutions to optimization problems.
However, the question whether crossover is provably useful for typical algorithmic problems has been open for quite some time.
In this talk, we show that for the All-Pairs Shortest Path problem a natural genetic algorithm using both mutation and crossover provably outperforms an algorithm that uses only mutation.
Contact
Edda Happ
--email hidden
passcode not visible
logged in users only
Edda Happ, 03/17/2009 13:31 -- Created document.