Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 10, 2013, 12:15 pm
Duration: 45 minutes
Location: CAB G51
Speaker: Nick Spooner
Evolutionary algorithms have shown themselves to be a powerful and effective tool for many optimisation problems where a specialised algorithm is not easily obtainable. Theoretical analysis of evolutionary algorithms remains quite primitive, and most efforts focus on toy examples and simple combinatorial problems. In this talk we discuss the application of a simple (1+1) evolutionary algorithm to the single-source shortest path problem, a well-studied problem in computer science, and examine the effect of the choice of representation and fitness function on the expected optimisation time.
Automatic MiSe System Software Version 1.4803M | admin login