01.11.2016

Four papers accepted at the 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA 2017)

The Workshop on Foundations of Genetic Algorithms (FOGA) is a biennial conference organized by the ACM Special Interest Group on Genetic and Evolutionary Computation. It is the flagship venue for research on the theoretical foundations of evolutionary computation and is rated A* by the Computing Research and Education Association. The 14th edition of FOGA will be held January 12-15, 2017 in Copenhagen, Denmark.

The Algorithm Engineering group contributes a total of four papers in close cooperation with researchers from the University of Adelaide and the Technical University of Denmark.

Krejca, Martin S.; Witt, Carsten Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMaxFoundations of Genetic Algorithms (FOGA) 2017: 65–79

[ BibTeX ]

Friedrich, Tobias; Kötzing, Timo; Quinzan, Francesco; Sutton, Andrew Michael Resampling vs Recombination: a Statistical Run Time EstimationFoundations of Genetic Algorithms (FOGA) 2017: 25–35

[ BibTeX ]

Friedrich, Tobias; Kötzing, Timo; Lagodzinski, J. A. Gregor; Neumann, Frank; Schirneck, Martin Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear ConstraintsFoundations of Genetic Algorithms (FOGA) 2017: 45–54

[ BibTeX ]

Pourhassan, Mojgan; Friedrich, Tobias; Neumann, Frank On the Use of the Dual Formulation for Minimum Weighted Vertex Cover in Evolutionary AlgorithmsFoundations of Genetic Algorithms (FOGA) 2017: 37–44

[ BibTeX ]

Four papers accepted at the 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA 2017)

Algorithm Engineering

Contact

Apply