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, April 28, 2020, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Johannes Lengler

Why do we theory of optimization heuristics?

The theory of optimization heuristics like evolutionary algorithms looks rather different from other TCS areas. In this talk, I will give a general overview on how theory in this field looks like, and why I believe it makes sense to do this kind of research. I will give some examples in which theoretical analysis has given us insights into search heuristics that we probably couldn't have found otherwise.

This talk is based on an invited talk at the COSEAL 2019 conference. COSEAL (workshop on configuration and selection of algorithms) is an applied conference that was co-located with FOGA (foundations of genetic algorithms), a theory conference. So I was asked to give a talk that explains to non-theoreticians why we do theory, and what we can gain from it.

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