Published in: Dagstuhl Reports, Volume 12, Issue 5 (2022)
Josu Ceberio Uribe, Benjamin Doerr, Carsten Witt, and Vicente P. Soloviev. Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). In Dagstuhl Reports, Volume 12, Issue 5, pp. 17-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{uribe_et_al:DagRep.12.5.17, author = {Uribe, Josu Ceberio and Doerr, Benjamin and Witt, Carsten and Soloviev, Vicente P.}, title = {{Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182)}}, pages = {17--36}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {12}, number = {5}, editor = {Uribe, Josu Ceberio and Doerr, Benjamin and Witt, Carsten and Soloviev, Vicente P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.5.17}, URN = {urn:nbn:de:0030-drops-174421}, doi = {10.4230/DagRep.12.5.17}, annote = {Keywords: estimation-of-distribution algorithms, heuristic search and optimization, machine learning, probabilistic model building} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Carsten Witt. Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 420-431, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{witt:LIPIcs.STACS.2012.420, author = {Witt, Carsten}, title = {{Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {420--431}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.420}, URN = {urn:nbn:de:0030-drops-33920}, doi = {10.4230/LIPIcs.STACS.2012.420}, annote = {Keywords: Randomized Search Heuristics, Evolutionary Algorithms, Linear Functions, Running Time Analysis} }
Published in: Dagstuhl Seminar Proceedings, Volume 10361, Theory of Evolutionary Algorithms (2010)
Anne Auger, Jonathan L. Shapiro, L. Darrell Whitley, and Carsten Witt. 10361 Abstracts Collection and Executive Summary – Theory of Evolutionary Algorithms. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 10361, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{auger_et_al:DagSemProc.10361.1, author = {Auger, Anne and Shapiro, Jonathan L. and Whitley, L. Darrell and Witt, Carsten}, title = {{10361 Abstracts Collection and Executive Summary – Theory of Evolutionary Algorithms}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10361}, editor = {Anne Auger and Jonathan L. Shapiro and L. Darrell Whitley and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10361.1}, URN = {urn:nbn:de:0030-drops-28180}, doi = {10.4230/DagSemProc.10361.1}, annote = {Keywords: Evolutionary algorithms, bio-inspired search heuristics, theoretical analysis, optimization time} }
Published in: Dagstuhl Seminar Proceedings, Volume 10361, Theory of Evolutionary Algorithms (2010)
William Langdon. 2-bit Flip Mutation Elementary Fitness Landscapes. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 10361, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{langdon:DagSemProc.10361.2, author = {Langdon, William}, title = {{2-bit Flip Mutation Elementary Fitness Landscapes}}, booktitle = {Theory of Evolutionary Algorithms}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10361}, editor = {Anne Auger and Jonathan L. Shapiro and L. Darrell Whitley and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10361.2}, URN = {urn:nbn:de:0030-drops-28146}, doi = {10.4230/DagSemProc.10361.2}, annote = {Keywords: Genetic Algorithms, Genetic Programming, search, optimisation, graph theory, Laplacian, Hamming cube} }
Published in: Dagstuhl Seminar Proceedings, Volume 10361, Theory of Evolutionary Algorithms (2010)
Christian Lorenz Mueller. Exploring the common concepts of adaptive MCMC and Covariance Matrix Adaptation schemes. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 10361, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{mueller:DagSemProc.10361.3, author = {Mueller, Christian Lorenz}, title = {{Exploring the common concepts of adaptive MCMC and Covariance Matrix Adaptation schemes}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10361}, editor = {Anne Auger and Jonathan L. Shapiro and L. Darrell Whitley and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10361.3}, URN = {urn:nbn:de:0030-drops-28135}, doi = {10.4230/DagSemProc.10361.3}, annote = {Keywords: Adaptive MCMC, Gaussian Adaptation, CMA-ES, covari- ance matrix adaptation} }
Published in: Dagstuhl Seminar Proceedings, Volume 8051, Theory of Evolutionary Algorithms (2008)
Dirk V. Arnold, Anne Auger, Carsten Witt, and Jonathan E. Rowe. 08051 Abstracts Collection – Theory of Evolutionary Algorithms. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 8051, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{arnold_et_al:DagSemProc.08051.1, author = {Arnold, Dirk V. and Auger, Anne and Witt, Carsten and Rowe, Jonathan E.}, title = {{08051 Abstracts Collection – Theory of Evolutionary Algorithms}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8051}, editor = {Dirk V. Arnold and Anne Auger and Jonathan E. Rowe and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08051.1}, URN = {urn:nbn:de:0030-drops-15242}, doi = {10.4230/DagSemProc.08051.1}, annote = {Keywords: Evolutionary Computation, Theory of Evolutionary Algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 8051, Theory of Evolutionary Algorithms (2008)
Dirk V. Arnold, Anne Auger, Jonathan E. Rowe, and Carsten Witt. 08051 Executive Summary – Theory of Evolutionary Algorithms. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 8051, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{arnold_et_al:DagSemProc.08051.2, author = {Arnold, Dirk V. and Auger, Anne and Rowe, Jonathan E. and Witt, Carsten}, title = {{08051 Executive Summary – Theory of Evolutionary Algorithms}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8051}, editor = {Dirk V. Arnold and Anne Auger and Jonathan E. Rowe and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08051.2}, URN = {urn:nbn:de:0030-drops-14812}, doi = {10.4230/DagSemProc.08051.2}, annote = {Keywords: Evolutionary Algorithms, Theory of Evolutionary Algorithms} }
Published in: Dagstuhl Seminar Proceedings, Volume 8051, Theory of Evolutionary Algorithms (2008)
Jun He, Yuren Zhou, and Xin Yao. A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 8051, pp. 1-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{he_et_al:DagSemProc.08051.3, author = {He, Jun and Zhou, Yuren and Yao, Xin}, title = {{A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--39}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8051}, editor = {Dirk V. Arnold and Anne Auger and Jonathan E. Rowe and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08051.3}, URN = {urn:nbn:de:0030-drops-14822}, doi = {10.4230/DagSemProc.08051.3}, annote = {Keywords: Genetic Algorithms, Constrained Optimization, Knapsack Problem, Computation Time, Performance Analysis} }
Published in: Dagstuhl Seminar Proceedings, Volume 8051, Theory of Evolutionary Algorithms (2008)
Boris S. Mitavskiy and Chris Cannings. Evaluating Stationary Distribution of the Binary GA Markov Chain in Special Cases. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 8051, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{mitavskiy_et_al:DagSemProc.08051.4, author = {Mitavskiy, Boris S. and Cannings, Chris}, title = {{Evaluating Stationary Distribution of the Binary GA Markov Chain in Special Cases}}, booktitle = {Theory of Evolutionary Algorithms}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8051}, editor = {Dirk V. Arnold and Anne Auger and Jonathan E. Rowe and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08051.4}, URN = {urn:nbn:de:0030-drops-14845}, doi = {10.4230/DagSemProc.08051.4}, annote = {Keywords: Genetic algorithms, Markov chains, stationary distribution, lumping quotient} }
Published in: Dagstuhl Seminar Proceedings, Volume 8051, Theory of Evolutionary Algorithms (2008)
Nicholas Freitag McPhee and Riccardo Poli. N-gram GP: Early results and half-baked ideas. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 8051, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{mcphee_et_al:DagSemProc.08051.5, author = {McPhee, Nicholas Freitag and Poli, Riccardo}, title = {{N-gram GP: Early results and half-baked ideas}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8051}, editor = {Dirk V. Arnold and Anne Auger and Jonathan E. Rowe and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08051.5}, URN = {urn:nbn:de:0030-drops-14838}, doi = {10.4230/DagSemProc.08051.5}, annote = {Keywords: Genetic programming, estimation of distribution algorithms, linear GP, machine learning} }
Published in: Dagstuhl Seminar Proceedings, Volume 8051, Theory of Evolutionary Algorithms (2008)
Dirk Sudholt and Carsten Witt. Runtime Analysis of Binary PSO. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 8051, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{sudholt_et_al:DagSemProc.08051.6, author = {Sudholt, Dirk and Witt, Carsten}, title = {{Runtime Analysis of Binary PSO}}, booktitle = {Theory of Evolutionary Algorithms}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8051}, editor = {Dirk V. Arnold and Anne Auger and Jonathan E. Rowe and Carsten Witt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08051.6}, URN = {urn:nbn:de:0030-drops-14800}, doi = {10.4230/DagSemProc.08051.6}, annote = {Keywords: Particle swarm optimization, runtime analysis} }
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-dev.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} }
Feedback for Dagstuhl Publishing