03408cam a2200373Ia 4500 u4950 SA-PMU 20210418123702.0 110524s2011 nyua b 101 0 eng d VYR VYR FER 9781450306331 1450306330 (OCoLC)726902201 QA402.5 .F69 2011 Workshop on Foundations of Genetic Algorithms (11th : 2011 : Schwarzenberg, Austria) FOGA '11 : proceedings of the ACM/SIGEVO Foundations of Genetic Algorithms XI. Proceedings of the ACM/SIGEVO Foundations of Genetic Algorithms XI New York, N.Y. : Association for Computing Machinery, 2011. viii, 253 p. : ill. ; 24 cm. 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. Combinatorial optimization Congresses. Machine learning Congresses. Genetic algorithms Congresses. Association for Computing Machinery. SIGEVO. Vorarlberg University of Applied Sciences (FHV). Hans-Georg Beyer & William B. Langdon. BOOK Z0 SUPMU 1 4172 4172 0 0 LC 0 0 MAIN MAIN 2021-04-18 0 QA402.5 .F69 2011 51952000120971 2021-04-15 1 2021-04-15 BOOK STACKS