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.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} }
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.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} }
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.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} }
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.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} }
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.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} }
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.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} }