|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3237859 |
| 003 |
MWH |
| 005 |
20191025022126.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s1998 xxu| s |||| 0|eng d |
| 020 |
|
|
|a 9781461557319
|
| 024 |
7 |
|
|a 10.1007/978-1-4615-5731-9
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-1-4615-5731-9
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM062000
|2 bisacsh
|
| 072 |
|
7 |
|a UMB
|2 thema
|
| 100 |
1 |
|
|a Langdon, William B.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
0 |
|a Genetic Programming and Data Structures
|h [electronic resource] :
|b Genetic Programming + Data Structures = Automatic Programming! /
|c by William B. Langdon.
|
| 250 |
|
|
|a 1st ed. 1998.
|
| 264 |
|
1 |
|a New York, NY :
|b Springer US :
|b Imprint: Springer,
|c 1998.
|
| 300 |
|
|
|a XIII, 279 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 Programming,
|x 1566-7863 ;
|v 1
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a 1. Introduction -- 1.1 What is Genetic Programming? -- 1.2 Motivation -- 1.3 Outline -- 2. Survey -- 2.1 Introduction -- 2.2 Genetic Algorithms -- 2.3 Genetic Programming -- 2.4 GP Research -- 2.5 GP Applications -- 2.6 Conclusions -- 3. Advanced Genetic Programming Techniques -- 3.1 Background -- 3.2 Tournament Selection -- 3.3 Steady State Populations -- 3.4 Indexed memory -- 3.5 Scalar Memory -- 3.6 Multi-tree programs -- 3.7 Directed Crossover -- 3.8 Demes -- 3.9 Pareto Optimality -- 3.10 Conclusions -- 4. Evolving a Stack -- 4.1 Problem Statement -- 4.2 Architecture -- 4.3 Choice of Primitives -- 4.4 Fitness Function -- 4.5 Parameters -- 4.6 Results -- 4.7 Summary -- 5. Evolving a Queue -- 5.1 Problem Statement -- 5.2 Architecture -- 5.3 Choice of Primitives -- 5.4 Fitness Functions -- 5.5 Parameters -- 5.6 Automatically Defined Functions -- 5.7 Evolved Solutions — Caterpillar -- 5.8 Evolved Programs — Shuffler -- 5.9 Circular Buffer — Given Modulus Increment -- 5.10 Circular Buffer — Evolving Modulus Increment -- 5.11 Discussion: Building Blocks and Introns -- 5.12 Summary -- 6. Evolving a List -- 6.1 Problem Statement -- 6.2 Architecture -- 6.3 Automatically Defined Functions -- 6.4 Choice of Primitives -- 6.5 Fitness Function -- 6.6 Directed Crossover -- 6.7 Parameters -- 6.8 Results -- 6.9 Software Maintenance -- 6.10 Discussion -- 6.11 Conclusions -- 7. Problems Solved Using Data Structures -- 7.1 Balanced Bracket Problem -- 7.2 Dyck Language -- 7.3 Evaluating Reverse Polish Expressions -- 7.4 Work by Others on Solving Problems with Memory -- 7.5 Summary -- 8. Evolution of GP Populations -- 8.1 Price’s Selection and Covariance Theorem -- 8.2 Fisher’s Fundamental Theorem of Natural Selection -- 8.3 Evolution of Stack Problem Populations -- 8.4 Loss of Variety -- 8.5 Measurements of GP Crossover’s Effects -- 8.6 Discussion -- 8.7 Summary -- 9. Conclusions -- 9.1 Recommendations -- 9.2 Future work -- References -- Appendices -- A–Number of Fitness Evaluations Required -- B–Glossary -- C–Scheduling Planned Maintenance of the National Grid -- C.1 Introduction -- C.2 The Electricity Transmission Network in Great Britain -- C.3 The South Wales Region of the UK Electricity Network -- C.4 Approximating Replacement Generation Costs -- C.5 The Fitness Function -- C.6 The Chromosome -- C.7 Greedy Optimisers -- C.8 South Wales Problem without Contingencies -- C.9 South Wales and Genetic Programming -- C.10 South Wales Problem with Contingencies -- C.11 Conclusions -- C.12 Future Work -- C.13 Using QGAME -- D–Implementation -- D.1 GP-QUICK -- D.2 Coding Changes to GP-QUICK-2.1 -- D.3 Default Parameters -- D.4 Network Running -- D.5 Reusing Ancestors Fitness Information -- D.6 Caches -- D.7 Compressing the Check Point File -- D.8 Benchmarks -- D.9 Code.
|
| 520 |
|
|
|a Computers that ̀program themselves' has long been an aim of computer scientists. Recently genetic programming (GP) has started to show its promise by automatically evolving programs. Indeed in a small number of problems GP has evolved programs whose performance is similar to or even slightly better than that of programs written by people. The main thrust of GP has been to automatically create functions. While these can be of great use they contain no memory and relatively little work has addressed automatic creation of program code including stored data. This issue is the main focus of Genetic Programming, and Data Structures: Genetic Programming + Data Structures = Automatic Programming!. This book is motivated by the observation from software engineering that data abstraction (e.g., via abstract data types) is essential in programs created by human programmers. This book shows that abstract data types can be similarly beneficial to the automatic production of programs using GP. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! shows how abstract data types (stacks, queues and lists) can be evolved using genetic programming, demonstrates how GP can evolve general programs which solve the nested brackets problem, recognises a Dyck context free language, and implements a simple four function calculator. In these cases, an appropriate data structure is beneficial compared to simple indexed memory. This book also includes a survey of GP, with a critical review of experiments with evolving memory, and reports investigations of real world electrical network maintenance scheduling problems that demonstrate that Genetic Algorithms can find low cost viable solutions to such problems. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! should be of direct interest to computer scientists doing research on genetic programming, genetic algorithms, data structures, and artificial intelligence. In addition, this book will be of interest to practitioners working in all of these areas and to those interested in automatic programming.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Microprocessors.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Genetic Programming,
|x 1566-7863 ;
|v 1
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-1-4615-5731-9
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b32378592
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g xxu
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21510246
|z 02-26-20
|
| 999 |
f |
f |
|i 3b90589e-8c0d-5635-8280-4edf843fc2cd
|s 3304e74d-2616-587f-a0b4-12336dded7ca
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|