FOGA A

22 papers

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