|
|
|
|
LEADER |
03865nam a22005055i 4500 |
001 |
978-0-387-31030-5 |
003 |
DE-He213 |
005 |
20151204182740.0 |
007 |
cr nn 008mamaa |
008 |
100301s2007 xxu| s |||| 0|eng d |
020 |
|
|
|a 9780387310305
|9 978-0-387-31030-5
|
024 |
7 |
|
|a 10.1007/978-0-387-31030-5
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q334-342
|
050 |
|
4 |
|a TJ210.2-211.495
|
072 |
|
7 |
|a UYQ
|2 bicssc
|
072 |
|
7 |
|a TJFM1
|2 bicssc
|
072 |
|
7 |
|a COM004000
|2 bisacsh
|
082 |
0 |
4 |
|a 006.3
|2 23
|
100 |
1 |
|
|a Brameier, Markus F.
|e author.
|
245 |
1 |
0 |
|a Linear Genetic Programming
|h [electronic resource] /
|c by Markus F. Brameier, Wolfgang Banzhaf.
|
264 |
|
1 |
|a Boston, MA :
|b Springer US,
|c 2007.
|
300 |
|
|
|a XVI, 316 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Genetic and Evolutionary Computation,
|x 1932-0167
|
505 |
0 |
|
|a Fundamental 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 |
|
|
|a Linear 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 |
|a Computer science.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Computing Methodologies.
|
700 |
1 |
|
|a Banzhaf, Wolfgang.
|e author.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9780387310299
|
830 |
|
0 |
|a Genetic and Evolutionary Computation,
|x 1932-0167
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-0-387-31030-5
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
950 |
|
|
|a Computer Science (Springer-11645)
|