Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, December 10, 2013, 12:15 pm

Duration: 45 minutes

Location: OAT S15/S16/S17

Speaker: Nick Spooner

Edge-Based Representation Beats Vertex-Based Representation in Shortest-Path Problems

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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