FOGA 2013 - FOGA '13 Foundations of Genetic Algorithms XII
Topics/Call fo Papers
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 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.
Other CFPs
- ACM SIGAda’s Annual International Conference on High Integrity Language Technology
- 1st Annual Conference on Research in Information Technology
- The ACM SIGGRAPH / Eurographics Symposium on Computer Animation
- The Tenth International Workshop on the Algorithmic Foundations of Robotics
- International Workshop on Logic and Synthesis
Last modified: 2012-03-03 21:59:15