Genetic Programming: An Introduction (The Morgan Kaufmann Series in Artificial Intelligence)
โ Scribed by Wolfgang Banzhaf, Peter Nordin, Robert E. Keller, Frank D. Francone
- Publisher
- Morgan Kaufmann
- Year
- 1997
- Tongue
- English
- Leaves
- 481
- Series
- The Morgan Kaufmann Series in Artificial Intelligence
- Edition
- 1st
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
I have no idea how this is marketed as a college level text on the subject. It is just a 'high level' text suitable for non programmers interested in learning some of the terminology regarding Genetic Programming, with little or no practical information. This book was published in 1998, there are many free texts with far more practical information. I bought A Field Guide to Genetic Programming, which is also available as a free pdf, with this book, and the Field Guide is a far far better book on all counts.
โฆ Subjects
ะะฝัะพัะผะฐัะธะบะฐ ะธ ะฒััะธัะปะธัะตะปัะฝะฐั ัะตั ะฝะธะบะฐ;ะัะบััััะฒะตะฝะฝัะน ะธะฝัะตะปะปะตะบั;ะญะฒะพะปััะธะพะฝะฝัะต ะฐะปะณะพัะธัะผั;
๐ SIMILAR VOLUMES
Foundations of Genetic Algorithms, Volume 6 is the latest in a series of books that records the prestigious Foundations of Genetic Algorithms Workshops, sponsored and organised by the International Society of Genetic Algorithms specifically to address theoretical publications on genetic algorithms a
<p><span>Foundations of Genetic Algorithms, Volume 6</span><span> is the latest in a series of books that records the prestigious Foundations of Genetic Algorithms Workshops, sponsored and organised by the International Society of Genetic Algorithms specifically to address theoretical publications o
Bioinformatics has never been as popular as it is today. The genomics revolution is generating so much data in such rapid succession that it has become difficult for biologists to decipher. In particular, there are many problems in biology that are too large to solve with standard methods. Researche
Until this book, possibly the only comprehensive treatment of planning has been a paper collection: Readings in Planning (Morgan Kaufmann Series in Representation and Reasoning). What these authors have done is phenominal - they've marshalled a bibliography of 565 publications into a comprehensive t
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algo