Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, January 27, 2009, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Christian Lorenz Müller (Mosaic Group)
Many research questions in chemistry, biology and bioinformatics can be reformulated as search problems that are characterized by high dimensionality, non-convexity and noise. A prominent example is the protein folding problem (that is known to be NP-hard) that can be considered as an optimization problem over an energy landscape. In most case, such problems can only be tackled by stochastic search/optimization heuristics.
One of the most successful gradient-less optimization heuristic for non-convex, real-valued functions is the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES). In the seminar we will present an extension of this algorithm, the Particle Swarm CMA-ES (PS-CMA-ES) algorithm that shows excellent performance on several hard benchmark problems. This heuristic can also be interpreted as a stochastic branch-and-bound algorithm.
In the outlook we will also give some insights about the interpretation of energy landscapes as weighted graphs, and the connection between protein folding and the MaxFlow-MinCut problem, and some open research topics. Hopefully, this seminar can stimulate future collaboration.
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