HTML Export for Dagstuhl Seminar Proceedings, Volume 6061

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 6061, </h2>
<ul>
<li>
    <span class="authors">Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, and Michael D. Vose</span>
    <span class="title">06061 Abstracts Collection – Theory of Evolutionary Algorithms</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.1">10.4230/DagSemProc.06061.1</a>
</li>
<li>
    <span class="authors">Dirk V. Arnold, Thomas Jansen, Jonathan E. Rowe, and Michael D. Vose</span>
    <span class="title">06061 Executive Summary – Theory of Evolutionary Algoritms</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.2">10.4230/DagSemProc.06061.2</a>
</li>
<li>
    <span class="authors">Marcus Gallagher and Bo Yuan</span>
    <span class="title">A Mathematical Modelling Technique for the Analysis of the Dynamics of a Simple Continuous EDA</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.3">10.4230/DagSemProc.06061.3</a>
</li>
<li>
    <span class="authors">Rudi Cilibrasi and Paul M. B. Vitany</span>
    <span class="title">A New Quartet Tree Heuristic for Hierarchical Clustering</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.4">10.4230/DagSemProc.06061.4</a>
</li>
<li>
    <span class="authors">Boris S. Mitavskiy and Jonathan E. Rowe</span>
    <span class="title">How fast does the stationary distribution of the Markov chain modelling EAs concentrate on the homogeneous populations for small mutation rate?</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.5">10.4230/DagSemProc.06061.5</a>
</li>
<li>
    <span class="authors">Anton Eremeev</span>
    <span class="title">On Complexity of Optimized Crossover for Binary Representations</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.6">10.4230/DagSemProc.06061.6</a>
</li>
<li>
    <span class="authors">William B. Langdon and Riccardo Poli</span>
    <span class="title">On Turing complete T7 and MISC F--4 program fitnes landscapes</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.7">10.4230/DagSemProc.06061.7</a>
</li>
<li>
    <span class="authors">Frank Neumann and Carsten Witt</span>
    <span class="title">Runtime Analysis of  a Simple Ant Colony Optimization Algorithm</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.8">10.4230/DagSemProc.06061.8</a>
</li>
<li>
    <span class="authors">Heinz Mühlenbein and Robin Höns</span>
    <span class="title">The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06061.9">10.4230/DagSemProc.06061.9</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode