Evolutionary Computation in Combinatorial Optimization 5th European
- PDF / 3,501,961 Bytes
- 282 Pages / 430 x 660 pts Page_size
- 108 Downloads / 240 Views
Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
3448
Günther R. Raidl Jens Gottlieb (Eds.)
Evolutionary Computation in Combinatorial Optimization 5th European Conference, EvoCOP 2005 Lausanne, Switzerland, March 30 - April 1, 2005 Proceedings
13
Volume Editors Günther R. Raidl Vienna University of Technology Institute of Computer Graphics and Algorithms Algorithms and Data Structures Group Favoritenstr. 9-11/186, 1040 Vienna, Austria E-mail: [email protected] Jens Gottlieb SAP AG Neurottstr. 16, 69190 Walldorf, Germany E-mail: [email protected]
Cover illustration: Triangular Urchin by Chaps (www.cetoine.com) Chaps has obtained an MSc in Physics at the Swiss Federal Institute of Technology. He is the developer of the ArtiE-Fract software that was used to create Triangular Urchin. Triangular Urchin (an Iterated Functions System of 2 polar functions) emerged from an urchin structure after a few generations usingArtiE-Fract. The evolutionary process was only based on soft mutations, some of them directly induced by the author.
Library of Congress Control Number: 2005922053 CR Subject Classification (1998): F.1, F.2, G.1.6, G.2.1, G.1 ISSN 0302-9743 ISBN 3-540-25337-8 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springeronline.com © Springer-Verlag Berlin Heidelberg 2005 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 11407041 06/3142 543210
Volume Editors
G¨ unther R. Raidl Algorithms and Data Structures Group Institute of Computer Graphics Vienna University of Technology Favoritenstrasse 9-11/186 1040 Vienna, Austria raid
Data Loading...
