000			03828nam a22004695i 4500
001			978-0-387-31030-5
003			DE-He213
005			20250710083947.0
007			cr nn 008mamaa
008			100301s2007 xxu| s |||| 0|eng d
020			_a9780387310305 _a99780387310305
024	7		_a10.1007/978-0-387-31030-5 _2doi
082	0	4	_a004.0151 _223
100	1		_aBrameier, Markus F. _eauthor.
245	1	0	_aLinear Genetic Programming _h[recurso electrónico] / _cby Markus F. Brameier, Wolfgang Banzhaf.
264		1	_aBoston, MA : _bSpringer US, _c2007.
300			_aXIII, 315 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aGenetic and Evolutionary Computation, _x1932-0167
505	0		_aFundamental Analysis -- Basic Concepts of Linear Genetic Programming -- Characteristics of the Linear Representation -- A Comparison with Neural Networks -- Method Design -- Linear Genetic Operators I - Segment Variations -- Linear Genetic Operators II - Instruction Mutations -- Analysis of Control Parameters -- A Comparison with Tree-Based Genetic Programming -- Advanced Techniques and Phenomena -- Control of Diversity and Variation Step Size -- Code Growth and Neutral Variations -- Evolution of Program Teams -- Epilogue.
520			_aLinear Genetic Programming examines the evolution of imperative computer programs written as linear sequences of instructions. In contrast to functional expressions or syntax trees used in traditional Genetic Programming (GP), Linear Genetic Programming (LGP) employs a linear program structure as genetic material whose primary characteristics are exploited to achieve acceleration of both execution time and evolutionary progress. Online analysis and optimization of program code lead to more efficient techniques and contribute to a better understanding of the method and its parameters. In particular, the reduction of structural variation step size and non-effective variations play a key role in finding higher quality and less complex solutions. This volume investigates typical GP phenomena such as non-effective code, neutral variations and code growth from the perspective of linear GP. The text is divided into three parts, each of which details methodologies and illustrates applications. Part I introduces basic concepts of linear GP and presents efficient algorithms for analyzing and optimizing linear genetic programs during runtime. Part II explores the design of efficient LGP methods and genetic operators inspired by the results achieved in Part I. Part III investigates more advanced techniques and phenomena, including effective step size control, diversity control, code growth, and neutral variations. The book provides a solid introduction to the field of linear GP, as well as a more detailed, comprehensive examination of its principles and techniques. Researchers and students alike are certain to regard this text as an indispensable resource.
650		0	_aCOMPUTER SCIENCE.
650		0	_aINFORMATION THEORY.
650		0	_aELECTRONIC DATA PROCESSING.
650		0	_aARTIFICIAL INTELLIGENCE.
650	1	4	_aCOMPUTER SCIENCE.
650	2	4	_aTHEORY OF COMPUTATION.
650	2	4	_aCOMPUTING METHODOLOGIES.
650	2	4	_aARTIFICIAL INTELLIGENCE (INCL. ROBOTICS).
700	1		_aBanzhaf, Wolfgang. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387310299
830		0	_aGenetic and Evolutionary Computation, _x1932-0167
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-31030-5 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SCS
942			_2ddc _cER
999			_c57094 _d57094