default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th FOGA 2019: Potsdam, Germany
- Tobias Friedrich, Carola Doerr
, Dirk V. Arnold:
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, FOGA 2019, Potsdam, Germany, August 27-29, 2019. ACM 2019, ISBN 978-1-4503-6254-2 - Hsien-Kuei Hwang, Carsten Witt:
Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools. 1-12 - Daiki Morinaga, Youhei Akimoto:
Generalized drift analysis in continuous domain: linear convergence of (1 + 1)-ES on strongly convex functions with Lipschitz continuous gradients. 13-24 - Benjamin Doerr:
An exponential lower bound for the runtime of the compact genetic algorithm on jump functions. 25-33 - Jonathan E. Rowe, Aishwaryaprajna:
The benefits and limitations of voting mechanisms in evolutionary optimisation. 34-42 - Patrick Spettel, Hans-Georg Beyer, Michael Hellwig:
Steady state analysis of a multi-recombinative meta-ES on a conically constrained problem with comparison to σSA and CSA. 43-57 - Jakob Bossek, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, Heike Trautmann:
Evolving diverse TSP instances by means of novel and creative mutation operators. 58-71 - Bilel Derbel, Arnaud Liefooghe, Sébastien Vérel, Hernán E. Aguirre, Kiyoshi Tanaka:
New features for continuous exploratory landscape analysis based on the SOO tree. 72-86 - Johannes Lengler, Xun Zou:
Exponential slowdown for larger populations: the (µ + 1)-EA on monotone functions. 87-101 - Jakob Bossek, Dirk Sudholt:
Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem. 102-115 - Vasil Khalidov, Maxime Oquab, Jérémy Rapin, Olivier Teytaud:
Consistent population control: generate plenty of points, but with a bit of resampling. 116-123 - Vahid Roostapour, Mojgan Pourhassan, Frank Neumann:
Analysis of baseline evolutionary algorithms for the packing while travelling problem. 124-132 - Feng Shi, Frank Neumann, Jianxin Wang:
Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem. 133-146 - Frank Neumann, Andrew M. Sutton:
Runtime analysis of the (1 + 1) evolutionary algorithm for the chance-constrained knapsack problem. 147-153 - Per Kristian Lehre, Phan Trung Hai Nguyen:
On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. 154-168 - Denis Antipov, Benjamin Doerr, Vitalii Karavaev:
A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones. 169-182
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-27 18:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
