Vanneschi / Gustafson / Moraglio | Genetic Programming | E-Book | sack.de
E-Book

E-Book, Englisch, 363 Seiten, eBook

Reihe: Theoretical Computer Science and General Issues

Vanneschi / Gustafson / Moraglio Genetic Programming

12th European Conference, EuroGP 2009 Tübingen, Germany, April, 15-17, 2009 Proceedings
2009
ISBN: 978-3-642-01181-8
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

12th European Conference, EuroGP 2009 Tübingen, Germany, April, 15-17, 2009 Proceedings

E-Book, Englisch, 363 Seiten, eBook

Reihe: Theoretical Computer Science and General Issues

ISBN: 978-3-642-01181-8
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark



This book constitutes the refereed proceedings of the 11th European Conference on Genetic Programming, EuroGP 2009, held in Tübingen, Germany, in April 2009 colocated with the Evo* 2009 events. The 21 revised plenary papers and 9 revised poster papers were carefully reviewed and selected from a total of 57 submissions. A great variety of topics are presented reflecting the current state of research in the field of genetic programming, including the latest work on representations, theory, operators and analysis, feature selection, generalisation, coevolution and numerous applications.

Vanneschi / Gustafson / Moraglio Genetic Programming jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Oral Presentations.- One-Class Genetic Programming.- Genetic Programming Based Approach for Synchronization with Parameter Mismatches in EEG.- Memory with Memory in Tree-Based Genetic Programming.- On Dynamical Genetic Programming: Random Boolean Networks in Learning Classifier Systems.- Why Coevolution Doesn’t “Work”: Superiority and Progress in Coevolution.- On Improving Generalisation in Genetic Programming.- Mining Evolving Learning Algorithms.- The Role of Population Size in Rate of Evolution in Genetic Programming.- Genetic Programming Crossover: Does It Cross over?.- Evolution of Search Algorithms Using Graph Structured Program Evolution.- Genetic Programming for Feature Subset Ranking in Binary Classification Problems.- Self Modifying Cartesian Genetic Programming: Fibonacci, Squares, Regression and Summing.- Automatic Creation of Taxonomies of Genetic Programming Systems.- Extending Operator Equalisation: Fitness Based Self Adaptive Length Distribution for Bloat Free GP.- Modeling Social Heterogeneity with Genetic Programming in an Artificial Double Auction Market.- Exploring Grammatical Evolution for Horse Gait Optimisation.- There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists.- Tree Based Differential Evolution.- A Rigorous Evaluation of Crossover and Mutation in Genetic Programming.- On Crossover Success Rate in Genetic Programming with Offspring Selection.- An Experimental Study on Fitness Distributions of Tree Shapes in GP with One-Point Crossover.- Posters.- Behavioural Diversity and Filtering in GP Navigation Problems.- A Real-Time Evolutionary Object Recognition System.- On the Effectiveness of Evolution Compared to Time-Consuming Full Search of Optimal 6-State Automata.- Semantic Aware Crossover for GeneticProgramming: The Case for Real-Valued Function Regression.- Beneficial Preadaptation in the Evolution of a 2D Agent Control System with Genetic Programming.- Adaptation, Performance and Vapnik-Chervonenkis Dimension of Straight Line Programs.- A Statistical Learning Perspective of Genetic Programming.- Quantum Circuit Synthesis with Adaptive Parameters Control.- Comparison of CGP and Age-Layered CGP Performance in Image Operator Evolution.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.