[DMANET] Final CfP FOGA 2015 (Foundations of Genetic Algorithms XIII)

Subject: Final CfP FOGA 2015 (Foundations of Genetic Algorithms XIII)

Call for Papers (apologies for cross-posting)
The 13th ACM-SIGEVO Foundations of Genetic Algorithms (FOGA 2015)
17-20 January 2015, Aberystwyth, Wales, UK
http://www.sigevo.org/foga-2015
contact: foga@aber.ac.uk

Deadline for paper submission: 31 August, 2014
Notification of authors: 1 November, 2014
Post-proceedings deadline: 28 February, 2015

Submissions are made through EasyChair:
https://www.easychair.org/conferences/?conf=foga2015

Organisers:
Jun He, Aberystwyth University, jqh@aber.ac.uk
Thomas Jansen, Aberystwyth University, t.jansen@aber.ac.uk
Gabriela Ochoa, University of Stirling, gabriela.ochoa@cs.stir.ac.uk
Christine Zarges, University of Birmingham, c.zarges@cs.bham.ac.uk

We invite submissions to FOGA 2015, the 2015 ACM/SIGEVO Foundations of Genetic Algorithms XIII,which will be held 17--20 January 2015 in Aberystwyth, Wales, UK. FOGA is the premier event on the theoretical foundations of evolutionary computation and all kinds of randomised search heuristics, including but not limited to evolutionary algorithms, ant colony optimisation, artificial immune systems and particle swarm optimisation. Accepted papers will be published in post-conference proceedings by ACM Press.

Authors should submit their papers (15 page maximum) consistent with the
alternate ACM SIG style file by the submission deadline (for the class file and templates see http://www.acm.org/sigs/publications/proceedings-templates).
Submissions are made through EasyChair:
https://www.easychair.org/conferences/?conf=foga2015
Preliminary versions of the accepted papers will be distributed to participants at FOGA. Authors of papers presented at the FOGA workshop will be asked to contribute final versions of their papers as part of the post-conference proceedings published by ACM.

The goal of FOGA is to advance the theoretical understanding of evolutionary computation and all kinds of randomised search heuristics, promote theoretical work to the wider community and contribute to making randomised search heuristics more useful in practice. We particularly encourage submissions bridging theory and practice. In addition to strict mathematical investigations, experimental studies contributing towards the theoretical foundations of evolutionary computation methods are also welcome. Topics include but are not limited to runtime analysis; fitness landscapes and problem difficulty; single- and multi-objective optimisation problems; stochastic and dynamic environments; population
dynamics; statistical approaches; self-adaptation; black-box complexity; working principles of all kinds of randomised search heuristics.

FOGA 2015 is sponsored by ACM SIGEVO.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************