Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, and Michael D. Vose. 06061 Abstracts Collection – Theory of Evolutionary Algorithms. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{arnold_et_al:DagSemProc.06061.1, author = {Arnold, Dirk V. and Jansen, Thomas and Rowe, Jonathan E. and Vose, Michael D.}, title = {{06061 Abstracts Collection – Theory of Evolutionary Algorithms}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.1}, URN = {urn:nbn:de:0030-drops-6009}, doi = {10.4230/DagSemProc.06061.1}, annote = {Keywords: Evolutionary algorithms, evolutionary computation, theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, and Michael D. Vose. 06061 Executive Summary – Theory of Evolutionary Algoritms. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{arnold_et_al:DagSemProc.06061.2, author = {Arnold, Dirk V. and Jansen, Thomas and Rowe, Jonathan E. and Vose, Michael D.}, title = {{06061 Executive Summary – Theory of Evolutionary Algoritms}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.2}, URN = {urn:nbn:de:0030-drops-5995}, doi = {10.4230/DagSemProc.06061.2}, annote = {Keywords: Evolutionary algorithms, evolutionary computation, theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Marcus Gallagher and Bo Yuan. A Mathematical Modelling Technique for the Analysis of the Dynamics of a Simple Continuous EDA. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{gallagher_et_al:DagSemProc.06061.3, author = {Gallagher, Marcus and Yuan, Bo}, title = {{A Mathematical Modelling Technique for the Analysis of the Dynamics of a Simple Continuous EDA}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.3}, URN = {urn:nbn:de:0030-drops-5940}, doi = {10.4230/DagSemProc.06061.3}, annote = {Keywords: Estimation of Distribution Algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Rudi Cilibrasi and Paul M. B. Vitany. A New Quartet Tree Heuristic for Hierarchical Clustering. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{cilibrasi_et_al:DagSemProc.06061.4, author = {Cilibrasi, Rudi and Vitany, Paul M. B.}, title = {{A New Quartet Tree Heuristic for Hierarchical Clustering}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.4}, URN = {urn:nbn:de:0030-drops-5985}, doi = {10.4230/DagSemProc.06061.4}, annote = {Keywords: Genetic programming, hierarchical clustering, quartet tree method} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Boris S. Mitavskiy and Jonathan E. Rowe. How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small mutation rate?. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{mitavskiy_et_al:DagSemProc.06061.5, author = {Mitavskiy, Boris S. and Rowe, Jonathan E.}, title = {{How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small mutation rate?}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.5}, URN = {urn:nbn:de:0030-drops-5964}, doi = {10.4230/DagSemProc.06061.5}, annote = {Keywords: Markov chains, Evolutionary algorithms, coarse graining quotients of irreducible Markov chains, concentration on the uniform populations} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Anton Eremeev. On Complexity of Optimized Crossover for Binary Representations. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{eremeev:DagSemProc.06061.6, author = {Eremeev, Anton}, title = {{On Complexity of Optimized Crossover for Binary Representations}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.6}, URN = {urn:nbn:de:0030-drops-5932}, doi = {10.4230/DagSemProc.06061.6}, annote = {Keywords: Genetic Algorithm, Optimized Crossover, Complexity} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
William B. Langdon and Riccardo Poli. On Turing complete T7 and MISC F--4 program fitnes landscapes. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{langdon_et_al:DagSemProc.06061.7, author = {Langdon, William B. and Poli, Riccardo}, title = {{On Turing complete T7 and MISC F--4 program fitnes landscapes}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--28}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.7}, URN = {urn:nbn:de:0030-drops-5956}, doi = {10.4230/DagSemProc.06061.7}, annote = {Keywords: Genetic programming} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Frank Neumann and Carsten Witt. Runtime Analysis of a Simple Ant Colony Optimization Algorithm. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{neumann_et_al:DagSemProc.06061.8, author = {Neumann, Frank and Witt, Carsten}, title = {{Runtime Analysis of a Simple Ant Colony Optimization Algorithm}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.8}, URN = {urn:nbn:de:0030-drops-5928}, doi = {10.4230/DagSemProc.06061.8}, annote = {Keywords: Randomized Search Heuristics, Ant Colony Optimization, Runtime Analysis} }
Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)
Heinz Mühlenbein and Robin Höns. The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{muhlenbein_et_al:DagSemProc.06061.9, author = {M\"{u}hlenbein, Heinz and H\"{o}ns, Robin}, title = {{The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--27}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6061}, editor = {Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.9}, URN = {urn:nbn:de:0030-drops-5973}, doi = {10.4230/DagSemProc.06061.9}, annote = {Keywords: Junction tree, minimum relative entropy, maximum likelihood, Bethe-Kikuchi approximation} }
Published in: Dagstuhl Seminar Proceedings, Volume 4081, Theory of Evolutionary Algorithms (2006)
Hans-Georg Beyer, Thomas Jansen, Colin Reeves, and Michael D. Vose. 04081 Abstracts Collection – Theory of Evolutionary Algorithms. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 4081, pp. 1-19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{beyer_et_al:DagSemProc.04081.1, author = {Beyer, Hans-Georg and Jansen, Thomas and Reeves, Colin and Vose, Michael D.}, title = {{04081 Abstracts Collection – Theory of Evolutionary Algorithms}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {4081}, editor = {Hans-Georg Beyer and Thomas Jansen and Colin Reeves and Michael D. Vose}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04081.1}, URN = {urn:nbn:de:0030-drops-4981}, doi = {10.4230/DagSemProc.04081.1}, annote = {Keywords: Evolutionary algorithms, genetic programming, co-evolution, run time analysis, landscape analysis, Markov chains} }
Feedback for Dagstuhl Publishing