𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Evolutionary Algorithms

✍ Scribed by Ioannis T. Christou, Wayne Martin, Robert R. Meyer (auth.), Lawrence David Davis, Kenneth De Jong, Michael D. Vose, L. Darrell Whitley (eds.)


Book ID
127424770
Publisher
Springer
Year
1999
Tongue
English
Weight
3 MB
Edition
1
Category
Library
City
New York
ISBN
0387988262

No coin nor oath required. For personal study only.

✦ Synopsis


This IMA Volume in Mathematics and its Applications EVOLUTIONARY ALGORITHMS is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING." I thank Lawrence David Davis (Tica Associates), Kenneth De Jong (Computer Science, George Mason University), Michael D. Vose (Computer Science, The University of Tennessee), and L. Darrell Whitley (Computer Science, Colorado State University) for their excellent work in organizing the workshop and for editing the proceedings. Further appreciation is exΒ­ tended to Donald G. Truhlar (Chemistry and Supercomputing Institute, University of Minnesota) who was also one of the workshop organizers. In addition, I also take this opportunity to thank the National Science Foundation (NSF), Minnesota Supercomputing Institute (MSI), and the Army Research Office (ARO), whose financial support made the workshop possible. Willard Miller, Jr., Professor and Director v PREFACE The IMA Workshop on Evolutionary Algorithms brought together many of the top researchers working in the area of Evolutionary ComΒ­ putation for a week of intensive interaction. The field of Evolutionary Computation has developed significantly over the past 30 years and today consists a variety of subfields such as genetic algorithms, evolution strateΒ­ gies, evolutionary programming, and genetic programming, each with their own algorithmic perspectives and goals.

✦ Subjects


Artificial Intelligence (incl. Robotics)


πŸ“œ SIMILAR VOLUMES


Evaluating evolutionary algorithms
✍ W. Whitney; S. Rana; J. Dzubera; K.E. Mathias πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 165 KB

We consider what tagging models are most appropriate as front ends for probabilistic context-free grammar parsers. In particular, we ask if using a "multiple tagger", a tagger that returns more than one tag, improves parsing performance. Our conclusion is somewhat surprising: single-tag Markov-mode

Evolutionary graph drawing algorithms
✍ Huang Jing-wei; Wei Wen-fang πŸ“‚ Article πŸ“… 2003 πŸ› Wuhan University 🌐 English βš– 389 KB
Towards hybrid evolutionary algorithms
✍ Ph. Preux; E.-G. Talbi πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 198 KB