12-15 January 2017, Copenhagen, Denmark
http://foga-2017.sigevo.org
contact: foga@list.ku.dk
FOGA is the premier event on the theoretical foundations of evolutionary
computation and invites submissions on all kinds of randomised search
heuristics, including but not limited to evolutionary algorithms, ant
colony optimisation, artificial immune systems, particle swarm
optimisation, simulated annealing, Bayesian optimisation, and other
Monte Carlo methods for search and optimisation.
The goal of FOGA is to advance the theoretical understanding of
randomised search heuristics and to contribute to making randomised
search heuristics more useful in practice. We particularly encourage
submissions bridging theory and practice. In addition to rigorous
mathematical investigations, experimental studies contributing towards
the theoretical foundations of randomised search heuristics 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.
Accepted papers will be published in post-conference proceedings by ACM
Press.
Authors should submit their papers (12 page maximum) consistent with the
alternate ACM SIG style file by the submission deadline (see
http://www.acm.org/sigs/publications/proceedings-templates).
Submissions are made through EasyChair:
https://www.easychar.org/conferences/?conf=foga2017
Deadline for paper submission: 31 August, 2016 (non-extensible)
Notification of authors: 1 November, 2016
Organisers:
Christian Igel, University of Copenhagen, Denmark.
Dirk Sudholt, University of Sheffield, United Kingdom.
Carsten Witt, Technical University of Denmark, Denmark.
Apologies for cross-posting!
**********************************************************
*
* 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/
*
**********************************************************