Sponsored by ACM SIGEVO, supported by Vorarlberg University of Applied Sciences (FHV), edited by Hans-Georg Beyer & William B. Langdon.

"Schwarzenberg, Austria January 5-9, 2011"--Cover.

Includes bibliographical references and author index.

"Welcome to the eleventh Foundations of Genetic Algorithms (FOGA XI) workshop proceedings. This time, FOGA was held in the Gasthof Hirschen, Schwarzenberg, Austria, (5-9 January 2011). It was supported by the Vorarlberg University of Applied Sciences (FHV)."--Abstract.

FOGA 2011 organisation -- FOGA 2011 sponsors & supporters -- Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering -- On the behaviour of the (1,^)-es for a simple constrained problem -- Elementary bit string mutation landscapes -- On the practicality of optimal output mechanisms for co-optimization algorithms -- Handling expensive optimization with large noise -- Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics -- The logarithmic hypervolume indicator -- Approximating the distribution of fitness over hamming regions -- The role of selective pressure when solving symmetric functions in polynomial time -- Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets -- Analyzing the impact of mirrored sampling and sequential selection in elitist evolution strategies -- Using markov-chain mixing time estimates for the analysis of ant colony optimization -- Abstract convex evolutionary search -- Faster black-box algorithms through higher arity operators -- Non-uniform mutation rates for problems with unknown solution lengths -- Adaptive population models for offspring populations and parallel evolutionary algorithms -- On the movement of vertex fixed points in the simple GA -- Simple max-min ant systems and the optimization of linear pseudo-boolean functions -- Using multivariate quantitative genetics theory to assist in EA customization -- Towards the geometry of estimation of distribution algorithms based on the exponential family -- Convergence rates of SMS-EMOA on continuous bi-objective problem classes -- Author index.

1