TOP
Suche auf der Schloss Dagstuhl Webseite
Sie suchen nach Informationen auf den Webseiten der einzelnen Seminare? - Dann:
Nicht fündig geworden? - Einige unserer Dienste laufen auf separaten Webseiten mit jeweils eigener Suche. Bitte beachten Sie folgende Liste:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminare
Innerhalb dieser Seite:
Externe Seiten:
  • DOOR (zum Registrieren eines Dagstuhl Aufenthaltes)
  • DOSA (zum Beantragen künftiger Dagstuhl Seminare oder Dagstuhl Perspektiven Workshops)
Publishing
Innerhalb dieser Seite:
Externe Seiten:
dblp
Innerhalb dieser Seite:
Externe Seiten:
  • die Informatik-Bibliographiedatenbank dblp


Dagstuhl-Seminar 02031

Theory of Evolutionary Algorithms

( 13. Jan – 18. Jan, 2002 )


Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite: https://www.dagstuhl.de/02031

Organisatoren



Motivation

Evolutionary algorithms, such as evolutionary programming (EP), evolution strategies (ES), genetic algorithms (GA), and genetic programming (GP), have attracted considerable interest as optimization heuristics during the past 10-15 years. Because of the exponential increase in computer power during the last decade, they are able to deal with real-world problems and new application domains are still arising.

Although evolutionary algorithms are easy to implement, the underlying process is complicated and stochastic, depending on the fitness function and the free parameters controlling variation and selection. The analysis of these stochastic processes seems to be much more difficult than the analysis of randomized algorithms for special purposes, e.g., primality testing.

The goal of our seminar is to contribute to the theory of evolutionary algorithms. As the second seminar on this topic it continues the "tradition" started with Dagstuhl Seminar 00071 in 2000: all aspects of analysis are considered, including but not limited to models of evolution as stochastic processes, dynamic and static performance investigations, progress rate analysis, and time complexity analysis.

The Seminar has the aim of bringing together researchers from all branches of evolutionary algorithms. Different points of view and different tools will be exchanged and we are hoping for synergistic effects of these discussions. For this reason not only computer scientists but also researchers from mathematics, physics, chemistry, and biology are invited.

Besides lectures on new results obtained by the participants we will have three keynote speakers presenting their different viewpoints on evolutionary algorithm theory. We plan to have an open problem session and plenty of time for informal discussions. This workshop style will be supported by the excellent facilities of Schloss Dagstuhl.


Teilnehmer
  • Alexandru Agapie (R&D Inst. for Microtechnologies - Bucharest, RO)
  • Dirk V. Arnold (Dalhousie University, CA) [dblp]
  • Wolfgang Banzhaf (Memorial University of Newfoundland, CA) [dblp]
  • Hans-Georg Beyer (Fachhochschule Vorarlberg, AT) [dblp]
  • Jürgen Branke (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Kenneth A. De Jong (George Mason University - Fairfax, US) [dblp]
  • Kalyanmoy Deb (Indian Inst. of Technology - Kanpur, IN) [dblp]
  • Stefan Droste (TU Dortmund, DE)
  • Anton V. Eremeev (Sobolev Institute of Mathematics - Omsk, RU) [dblp]
  • Christoph Flamm (Universität Wien, AT) [dblp]
  • James A. Foster (University of Idaho, US)
  • Robert Heckendorn (University of Idaho, US)
  • Jeff Horn (Northern Michigan University - Marquette, US)
  • Thomas Jansen (TU Dortmund, DE) [dblp]
  • Michael Kolonko (TU Clausthal, DE) [dblp]
  • William B. Langdon (University of Essex, GB) [dblp]
  • Nicholas Freitag McPhee (University of Minnesota - Morris, US)
  • Juan Julian Merelo (Universidad de Granada, ES)
  • Heinz Mühlenbein (Fraunhofer IAIS - St. Augustin, DE)
  • Bart Naudts (University of Antwerp, BE)
  • Riccardo Poli (University of Essex, GB) [dblp]
  • Adam Prugel-Bennett (University of Southampton, GB) [dblp]
  • Ingo Rechenberg (TU Berlin & EvoLogics GmbH, DE)
  • Colin Reeves (University of Coventry, GB)
  • Franz Rothlauf (Universität Mannheim, DE) [dblp]
  • Jonathan Rowe (University of Birmingham, GB) [dblp]
  • Lothar M. Schmitt (The University of Aizu, JP)
  • Hans-Paul Schwefel (Universität Dortmund, DE) [dblp]
  • Bernhard Sendhoff (Honda Research Europe - Offenbach, DE)
  • Jonathan L. Shapiro (University of Manchester, GB) [dblp]
  • Peter F. Stadler (Universität Leipzig, DE) [dblp]
  • Christopher Stephens (Universidad Nacional Autonoma - Mexico, MX)
  • Lothar Thiele (ETH Zürich, CH) [dblp]
  • Dirk Thierens (Utrecht University, NL) [dblp]
  • Marc Toussaint (University of Edinburgh, GB) [dblp]
  • Clarissa van Hoyweghen (University of Antwerp, BE)
  • Michael D. Vose (University of Tennessee, US) [dblp]
  • Ingo Wegener (TU Dortmund, DE)
  • Karsten Weicker (Universität Stuttgart, DE)
  • Alden Wright (University of Montana - Missoula, US)
  • Annie S. Wu (University of Central Florida - Orlando, US)

Verwandte Seminare
  • Dagstuhl-Seminar 00071: Theory of Evolutionary Algorithms (2000-02-13 - 2000-02-18) (Details)
  • Dagstuhl-Seminar 04081: Theory of Evolutionary Algorithms (2004-02-15 - 2004-02-20) (Details)
  • Dagstuhl-Seminar 06061: Theory of Evolutionary Algorithms (2006-02-05 - 2006-02-10) (Details)
  • Dagstuhl-Seminar 08051: Theory of Evolutionary Algorithms (2008-01-27 - 2008-02-01) (Details)
  • Dagstuhl-Seminar 10361: Theory of Evolutionary Algorithms (2010-09-05 - 2010-09-10) (Details)
  • Dagstuhl-Seminar 13271: Theory of Evolutionary Algorithms (2013-06-30 - 2013-07-05) (Details)
  • Dagstuhl-Seminar 15211: Theory of Evolutionary Algorithms (2015-05-17 - 2015-05-22) (Details)
  • Dagstuhl-Seminar 17191: Theory of Randomized Optimization Heuristics (2017-05-07 - 2017-05-12) (Details)
  • Dagstuhl-Seminar 19431: Theory of Randomized Optimization Heuristics (2019-10-20 - 2019-10-25) (Details)
  • Dagstuhl-Seminar 22081: Theory of Randomized Optimization Heuristics (2022-02-20 - 2022-02-25) (Details)