3rd Workshop on Theory of Randomized Search Heuristics

Tutorials

Two introductory tutorials will be given by experts in the field.

Theory of randomised search heuristics for continuous optimisation
  • Anne Auger (INRIA Saclay, France)
    Anne Auger received her diploma in mathematics from the University of Paris VI, France, in 2001. She also obtained the French highest diploma for teaching mathematics, "Agregation de mathematiques". She received the doctoral degree from the university Paris VI in 2004. Afterwards, she worked for two years (2004-2006) as a postdoctoral researcher at ETH (in Zurich) in the Computational Laboratory (CoLab). Since October 2006, she holds a permanent research position at INRIA (French National Research Institute in Computer Science and Applied Mathematics). Her research interests are stochastic continuous optimization, including theoretical analyses of randomized search heuristics. She published more than fifteen articles at top conferences and journals in this area. She organized (and will organize) the biannual Dagstuhl seminar "Theory of Evolutionary Computation" in 2008 (and 2010).
  • Nikolaus Hansen (INRIA Saclay, France)
    Nikolaus Hansen is a research scientist at the Saclay Microsoft Research -- INRIA joint center in France. Educated in medicine and mathematics, he received his Ph.D. in civil engineering in 1998 from the Technical University Berlin, working under Ingo Rechenberg. Since then he has been working in evolutionary computation and computational science at the Technical University Berlin and at ETH Zurich. His main research interests are learning and adaptation in evolutionary computation and the development of algorithms applicable in practice. His most well-known contribution to the field of evolutionary computation is the so-called Covariance Matrix Adaptation (CMA).
Theory of randomised search heuristics for discrete optimisation
  • Thomas Jansen (University College Cork, Ireland)
    Thomas Jansen, born 1969, studied Computer Science at the University of Dortmund, Germany. He received his diploma (1996) and Ph.D. (2000) there. From September 2001 to August 2002 he stayed as a Post-Doc at Kenneth De Jong's EClab at the George Mason University in Fairfax, VA. From September 2002 to February 2009 he had a position as Junior Professor for Computational Intelligence at the Technical University of Dortmund. Since March 2009 he is a Lecturer at the University College Cork, Ireland. His research is centered around design and theoretical analysis of randomised search heuristics, in particular evolutionary algorithms. He is an associate editor of Evolutionary Computation (MIT Press). He was a programm chair at PPSN 2008 and co-organized FOGA 2009.
  • Carsten Witt (Technical University of Denmark, Denmark)
    Carsten Witt studied Computer Science at the Technical University of Dortmund, Germany, where he received his diploma and Ph.D. in 2000 and 2004, respectively. Since spring 2009, he is an assistant professor at the Technical University of Denmark. Carsten's main research interests are the theoretical aspects of randomized search heuristics, in particular evolutionary algorithms, ant colony optimization and particle swarm optimization.