default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11th FOGA 2011: Schwarzenberg, Austria
- Hans-Georg Beyer, William B. Langdon:
Foundations of Genetic Algorithms, 11th International Workshop, FOGA 2011, Schwarzenberg, Austria, January 5-8, 2011, Proceedings. ACM 2011, ISBN 978-1-4503-0633-1 - Thomas Jansen
, Christine Zarges:
Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. 1-14 - Dirk V. Arnold:
On the behaviour of the (1, λ)-es for a simple constrained problem. 15-24 - William B. Langdon:
Elementary bit string mutation landscapes. 25-42 - Elena Popovici, Ezra Winston, Anthony Bucci:
On the practicality of optimal output mechanisms for co-optimization algorithms. 43-60 - Rémi Coulom, Philippe Rolet, Nataliya Sokolovska, Olivier Teytaud:
Handling expensive optimization with large noise. 61-68 - Greg Durrett, Frank Neumann, Una-May O'Reilly:
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. 69-80 - Tobias Friedrich, Karl Bringmann, Thomas Voß, Christian Igel:
The logarithmic hypervolume indicator. 81-92 - Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe:
Approximating the distribution of fitness over hamming regions. 93-104 - Lars Kaden, Nicole Weicker, Karsten Weicker:
The role of selective pressure when solving symmetric functions in polynomial time. 105-118 - Benjamin Doerr, Daniel Johannsen, Martin Schmidt:
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. 119-126 - Anne Auger, Dimo Brockhoff, Nikolaus Hansen:
Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies. 127-138 - Dirk Sudholt:
Using markov-chain mixing time estimates for the analysis of ant colony optimization. 139-150 - Alberto Moraglio:
Abstract convex evolutionary search. 151-162 - Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Per Kristian Lehre, Markus Wagner, Carola Winzen:
Faster black-box algorithms through higher arity operators. 163-172 - Stephan Cathabard, Per Kristian Lehre, Xin Yao:
Non-uniform mutation rates for problems with unknown solution lengths. 173-180 - Jörg Lässig, Dirk Sudholt:
Adaptive population models for offspring populations and parallel evolutionary algorithms. 181-192 - Alden H. Wright, Tomás Gedeon, J. Neal Richter:
On the movement of vertex fixed points in the simple GA. 193-208 - Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner:
Simple max-min ant systems and the optimization of linear pseudo-boolean functions. 209-218 - Jeffrey Kermes Bassett, Kenneth A. De Jong:
Using multivariate quantitative genetics theory to assist in EA customization. 219-230 - Luigi Malagò, Matteo Matteucci, Giovanni Pistone:
Towards the geometry of estimation of distribution algorithms based on the exponential family. 230-242 - Nicola Beume, Marco Laumanns, Günter Rudolph:
Convergence rates of SMS-EMOA on continuous bi-objective problem classes. 243-252
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-03-04 02:02 CET 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:
