XV)
August 27-29, 2019
Potsdam, Germany
https://hpi.de/foga2019/
####################################
Important News
####################################
(1) As reflected by our program committee and the call for papers, FOGA
XV aims to be (more) inclusive with respect to the methodology applied,
i.e., we invite all works aiming to understand algorithms' performance,
regardless of whether this is achieved through a rigorous
mathematical investigation or a carefully crafted empirical studies.
(2) Note that this year camera-ready papers will be collected BEFORE the
conference, to allow a faster dissemination of the results, i.e., we do
no longer support post-conference proceedings
(3) FOGA XV will be co-located with the seventh COnfiguration and
SElection of ALgorithms (COSEAL) Workshop
(https://www.coseal.net/coseal-workshop-2019/),
organized by Holger Hoos and Marius Lindauer. COSEAL is a workshop
series for discussing the most recent advances in the automated
configuration and selection of algorithms. The workshop takes place just
before FOGA, on August 26 and 27.
####################################
Call for Papers and Important Dates
####################################
The FOGA workshop series aims at advancing our understanding of the
working principles behind evolutionary algorithms and related randomized
search heuristics, such as local search algorithms, differential
evolution, ant colony optimization, particle swarm optimization,
artificial immune systems, simulated annealing, and other Monte Carlo
methods for search and optimization. Connections to related areas, such
as Bayesian optimization and direct search, are of interest as well.
FOGA is the premier event to discuss advances on the theoretical
foundations of these algorithms, tools needed to analyze them, and
different aspects of comparing algorithms' performance. Topics of
interest include, but are not limited to:
Run time analysis
Mathematical tools suitable for the analysis of search heuristics
Fitness landscapes and problem difficulty
(On- and offline) configuration and selection of algorithms,
heuristics, operators, and parameters
Stochastic and dynamic environments, noisy evaluations
Constrained optimization
Problem representation
Complexity theory for search heuristics
Multi-objective optimization
Benchmarking aspects, including performance measures, the selection
of meaningful benchmark problems, and statistical aspects
Connection between black-box optimization and machine learning
Submissions covering the entire spectrum of work, ranging from
rigorously derived mathematical results to carefully crafted empirical
studies, are invited.
Accepted papers will be published in proceedings by ACM Press.
Authors should submit their papers (15 page maximum) consistent with the
alternate ACM SIG style file by the submission deadline.
Submissions are made through EasyChair:
https://easychair.org/conferences/?conf=foga2019
Important Dates:
Deadline for paper submission: April 17, 2019 (non-extensible)
Author rebuttal phase: May 21-23, 2019
Notification of authors: June 5, 2019
Camera-ready paper: June 21, 2019
Organizers:
Tobias Friedrich, Hasso Plattner Institut, Potsdam, General Chair
Dirk Arnold, Dalhousie University, Program Chair
Carola Doerr, CNRS researcher at Sorbonne University, Paris, Program
Chair
**********************************************************
*
* 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/
*
**********************************************************
Posts
