Preparation Instructions for FOGA'13 Papers (click here)
Accepted Papers

Davide Bresolin, Fernando Jiménez, Gracia Sánchez and Guido Sciavicco: Finite Satisfiability of Propositional Interval Logic Formulas with Multi-Objective Evolutionary Algorithms

Thomas Jansen, Pietro S. Oliveto and Christine Zarges: Approximating Vertex Cover Using Edge-Based Representations

Samadhi Nallaperuma, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf Mersmann and Heike Trautmann: A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem

Anh Quang Nguyen, Tommaso Urli and Markus Wagner: Improved Computational Complexity Results for Weighted ORDER and MAJORITY

Hans-Georg Beyer and Michael Hellwig: Controlling Population Size and Mutation Strength by Meta-ES under Fitness Noise

Olivier Teytaud and Jérémie Decock: Noisy Optimization Complexity

Alan Lockett and Risto Miikkulainen: A Measure-Theoretic Analysis of Stochastic Optimization

Andrea Mambrini, Luca Manzoni and Alberto Moraglio: Runtime Analysis of Mutation-Based Geometric Semantic Genetic Programming on Boolean Functions

Youhei Akimoto and Yann Ollivier: Objective Improvement in Information-Geometric Optimization

Keki Burjorjee: Explaining Adaptation in Genetic Algorithms with Uniform Crossover

Yan Pei and Hideyuki Takagi: Triple and Quadruple Comparison-Based Interactive Differential Evolution and Differential Evolution

Matthias Feldmann and Timo Kötzing: Optimizing Expected Path Lengths with Ant Colony Optimization Using Fitness Proportional Update

Benjamin Doerr, Dirk Sudholt and Carsten Witt: When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?

Boris Mitavskiy: A Further Generalization of the Finite-Population Geiringer-like Theorem for POMDPs to Allow Recombination Over Arbitrary Set Covers

Per Kristian Lehre and Ender Özcan: A runtime analysis of simple hyper-heuristics: To mix or not to mix operators

Erik Hemberg, Kalyan Veeramachaneni, Constantin Berzan and Una-May O'Reilly: Introducing Graphical Models to Analyse Genetic Programming Dynamics

Call for papers PDF

We invite submissions to the Foundations of Genetic Algorithms (FOGA) 2013 workshop which will be held from January 16-20, 2013, in Adelaide, Australia.

FOGA is the premier event on the theoretical foundations of all kinds of evolutionary computation techniques including (but not limited to) evolutionary algorithms, ant colony optimization, and particle swarm optimization. Accepted papers will be published in a post-conference proceedings by ACM Press. The goal of FOGA 2013 is to advance the theoretical understanding of evolutionary computing techniques and to promote theoretical work to the wider community. A successful exchange between theory and practice on evolutionary computation is very desirable and so we encourage submissions bridging theory and practice. In addition to strict mathematical investigations, experimental studies increasing the theoretical foundations of evolutionary computation methods are very welcome.

Topics include (but are not limited to): fitness landscapes and problem difficulty, population dynamics, runtime analysis, self-adaptation, single- and multi-objective problems, statistical approaches, stochastic and dynamic environments, and working principles of evolutionary computing techniques in general.

FOGA XII is sponsored by ACM SIGEVO, You can join SIGEVO here.
FOGA XII is supported by The University of Adelaide

FOGA 2011   FOGA 2009     FOGA 2007     FOGA 2005      FOGA 7

* First seven FOGA (1990 -- 2002) published by Morgan Kaufmann