Evolutionary Algorithms

Lawrence D. Davis

ISBN 10: 1461271851 / ISBN 13: 9781461271857

Verlag: Springer, Humana, 2012

Beschreibung

Druck auf Anfrage Neuware - Printed after ordering - 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.

Bestandsnummer des Verkäufers 9781461271857

Bibliografische Details

• Titel: Evolutionary Algorithms
• Verlag: Springer, Humana
• Erscheinungsjahr: 2012
• Sprache: Englisch
• ISBN-10: 1461271851
• ISBN-13: 9781461271857
• Einband: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

This volume is based on the proceedings of a workshop, Evolutionary Algorithms, that was an integral part of the 1996-97 IMA program on Mathematics in High-Performance Computing. It brought together top researchers working in the area of Evolutionary Computation for a week of intensive interaction. Some very surprising and impressive applications were presented at the workshop, including data decomposition, deriving control parameters for modeling systems using partial differential equations, and even new best known solutions to bin packing problems. The workshop did a great deal to clarify the current state of the theory in Evolutionary algorithms and was useful for bringing people together and strengthening the evolutionary

Reseña del editor

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.