000			03408cam a2200373Ia 4500
001			u4950
003			SA-PMU
005			20210418123702.0
008			110524s2011 nyua b 101 0 eng d
040			_aVYR _cVYR _dFER
020			_a9781450306331
020			_a1450306330
035			_a(OCoLC)726902201
090			_aQA402.5 _b.F69 2011
111	2		_aWorkshop on Foundations of Genetic Algorithms _n(11th : _d2011 : _cSchwarzenberg, Austria)
245	1	0	_aFOGA '11 : _bproceedings of the ACM/SIGEVO Foundations of Genetic Algorithms XI.
246	3		_aProceedings of the ACM/SIGEVO Foundations of Genetic Algorithms XI
260			_aNew York, N.Y. : _bAssociation for Computing Machinery, _c2011.
300			_aviii, 253 p. : _bill. ; _c24 cm.
500			_aSponsored by ACM SIGEVO, supported by Vorarlberg University of Applied Sciences (FHV), edited by Hans-Georg Beyer & William B. Langdon.
500			_a"Schwarzenberg, Austria January 5-9, 2011"--Cover.
504			_aIncludes bibliographical references and author index.
520	3		_a"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.
505	0		_aFOGA 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.
650		0	_aCombinatorial optimization _vCongresses.
650		0	_aMachine learning _vCongresses.
650		0	_aGenetic algorithms _vCongresses.
710	2		_aAssociation for Computing Machinery. _bSIGEVO.
710	2		_aVorarlberg University of Applied Sciences (FHV).
710	2		_aHans-Georg Beyer & William B. Langdon.
942			_cBOOK
994			_aZ0 _bSUPMU
596			_a1
999			_c4172 _d4172