%0 Book %1 langdon:book %A Langdon, William B. %B Genetic Programming %C Boston %D 1998 %I Kluwer %K OOGP, Pareto Price's algorithms, analysis, covariance data, fitness, genetic list, memory, multi-objective programming, queue, selection stack, theorem %T Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! %U http://www.wkap.nl/prod/b/0-7923-8135-1 %V 1 %@ 0-7923-8135-1

@book{langdon:book, added-at = {2008-06-19T17:35:00.000+0200}, address = {Boston}, author = {Langdon, William B.}, biburl = {https://www.bibsonomy.org/bibtex/266c399f308c9268dbf2227e40f121baf/brazovayeye}, email = {kluwer@wkap.com}, interhash = {e4c4f8a73b481aaefc49b9b7b43ef10d}, intrahash = {66c399f308c9268dbf2227e40f121baf}, isbn = {0-7923-8135-1}, keywords = {OOGP, Pareto Price's algorithms, analysis, covariance data, fitness, genetic list, memory, multi-objective programming, queue, selection stack, theorem}, month = {24 April}, notes = {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. It is this issue which GENETIC PROGRAMMING AND DATA STRUCTURES addresses. 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 will show that abstract data types can be similarly beneficial to the automatic production of programs using GP. GENETIC PROGRAMMING AND DATA STRUCTURES shows how abstract data types (stacks, queues and lists) can be evolved using genetic programming, demonstrate GP can evolve general programs which solve the nested brackets problem, recognise a Dyck context free language and implement 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, including 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 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. Contents Foreword by John R. Koza. Preface. 1. Introduction. 2. Survey. 3. Advanced Genetic Programming Techniques. 4. Evolving a Stack. 5. Evolving a Queue. 6. Evolving a List. 7. Problems Solved Using Data Structures. 8. Evolution of GP Populations. 9. Conclusions. Appendices: A. Number of Fitness Evaluations Required. B. Glossary. C. Scheduling Planned Maintenance of the NationalGrid. D. Implementation. Index. Kluwer Accademic Publishers, Order Dept., Box 358, Accord Station, Hingham, MA 02018-0358, USA Tel: +1 781 871-6600 FAX: +1 781 871-6528 Tangent distribution of constants.}, publisher = {Kluwer}, series = {Genetic Programming}, size = {292 pages}, timestamp = {2008-06-19T17:44:51.000+0200}, title = {Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!}, url = {http://www.wkap.nl/prod/b/0-7923-8135-1}, volume = 1, year = 1998 }