Genetic Programming III: Darwinian Invention and Problem SolvingGenetic programming is a method for enabling a computer to solve a problem by telling it what needs to be done instead of how to do it. This method borrows from the theory and techniques of biological evolution to automatically create computer programs to solve problems. In this book, the authors present their latest and most important genetically evolved solutions to dozens of problems of design, optimal control, classification, systems identification, function learning, and computational molecular biology. More than half of the book focuses on the previously unsolved problem of analogue circuit synthesis. |
From inside the book
Results 1-5 of 96
Page ix
... Creation of an Executable Program .. .44 2.3.4 Automatic Creation of a Program's Sequence of Steps .... 45 5.1 5.1.1 ... Subroutine Duplication ..... The Relation of Duplication to and Case Splitting ... Self - Organization of Hierarchies by ...
... Creation of an Executable Program .. .44 2.3.4 Automatic Creation of a Program's Sequence of Steps .... 45 5.1 5.1.1 ... Subroutine Duplication ..... The Relation of Duplication to and Case Splitting ... Self - Organization of Hierarchies by ...
Page x
... Subroutine Deletion ..... 7.2.4 111 5.5.5 The Relation of Deletion to Generalization .. 111 8 . Loop Argument Creation , Loop Argument Duplication , and Loop Argument Deletion . Automatically Defined Recursion ... 147 ...... 145 5.6 ...
... Subroutine Deletion ..... 7.2.4 111 5.5.5 The Relation of Deletion to Generalization .. 111 8 . Loop Argument Creation , Loop Argument Duplication , and Loop Argument Deletion . Automatically Defined Recursion ... 147 ...... 145 5.6 ...
Page xi
... Subroutine Creation and Argument Creation .. Boolean Parity Problem Using Architecture - Altering Operations for Subroutines 12.1 Preparatory Steps . 13.3.6 Tableau . 13.4 Results .. .180 13.4.1 Emergence of Subroutines 13.4.2 Emergence ...
... Subroutine Creation and Argument Creation .. Boolean Parity Problem Using Architecture - Altering Operations for Subroutines 12.1 Preparatory Steps . 13.3.6 Tableau . 13.4 Results .. .180 13.4.1 Emergence of Subroutines 13.4.2 Emergence ...
Page 6
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 6
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Contents
Acknowledgments | xxiii |
Introduction 1 | lxvii |
Acknowledgments | lxxxvi |
Synthesis of a TwoBand Crossover | 4 |
for Iterations | 28 |
Background on Genetic Programming and Evolutionary | 28 |
Synthesis of a ThreeBand Crossover | 28 |
Synthesis of a Voltage Reference | 48 |
The Genetic Programming Problem Solver | 311 |
Emergence of Hierarchy Using | 561 |
Embryos and Test Fixtures | 571 |
Evolvable Hardware | 931 |
Discovery of Cellular Automata Rules | 959 |
Discovery of Motifs and Programmatic Motifs | 985 |
Parallelization and Implementation Issues | 1019 |
1138 | |
Other editions - View all
Common terms and phrases
ADF0 ADF1 ADF2 ADF3 ADFO ADFS ADLO architecture-altering operations ARG1 ARGO argument map automatically defined functions automatically defined iteration automatically defined loop automatically defined recursion automatically defined stores best-of-run body branch Boolean capacitor Chapter component computer programs condition branch dummy variables embryo evolutionary evolved executed Figure fitness measure function-defining branch functions and terminals gene duplication genetic algorithm genetic operations genetic programming GO_S GPPS hierarchy IFGTZ GO_SW IFGTZ IFGTZ INDEX inductor input internal storage invocation iteration-performing branch Koza lowpass filter maximum number modifiable wire mutation NAND netlist newly created node number of arguments Operations for Subroutines output overall program pace-setting PARALLELO Parameters picked branch population Preparatory Steps problem PROGN Program Architecture program tree protein protein segment random result result-producing branch robot RSOURCE run of genetic S-expression Section selected program sequence solving sorting network subroutine creation subroutine deletion subroutine duplication test fixture tion transmembrane two-argument vector voltage