Experimental Research in Evolutionary Computation The New Experiment
Experimentation is necessary - a purely theoretical approach is not reasonable. The new experimentalism, a development in the modern philosophy of science, considers that an experiment can have a life of its own. It provides a statistical methodology to l
- PDF / 2,718,208 Bytes
- 221 Pages / 439.37 x 666.141 pts Page_size
- 0 Downloads / 150 Views
Advisory Board: S. Amari G. Brassard K.A. De Jong C.C.A.M. Gielen T. Head L. Kari L. Landweber T. Martinetz Z. Michalewicz M.C. Mozer E. Oja G. P˘aun J. Reif H. Rubin A. Salomaa M. Schoenauer H.-P. Schwefel C. Torras D. Whitley E. Winfree J.M. Zurada
Thomas Bartz-Beielstein
Experimental Research in Evolutionary Computation The New Experimentalism
With 66 Figures and 36 Tables
123
Author
Series Editors
Thomas Bartz-Beielstein Chair of Algorithm Engineering and Systems Analysis Department of Computer Science University of Dortmund Otto-Hahn-Str. 14 44227 Dortmund, Germany [email protected]
G. Rozenberg (Managing Editor) [email protected] Th. Bäck, J.N. Kok, H.P. Spaink Leiden Center for Natural Computing Leiden University Niels Bohrweg 1 2333 CA Leiden, The Netherlands A.E. Eiben Vrije Universiteit Amsterdam The Netherlands
Library of Congress Control Number: 2006922082
ACM Computing Classification (1998): F.1, F.2, G.1.6, G.3, G.4, I.2.8, I.6, J.2 ISSN 1619-7127 ISBN-10 3-540-32026-1 Springer Berlin Heidelberg New York ISBN-13 978-3-540-32026-5 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, reuse of illustrations, recitation, broadcasting, reproduction on microfilm 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 for prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2006 Printed in Germany The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover Design: KünkelLopka, Werbeagentur, Heidelberg Typesetting: by the Author Production: LE-TEX Jelonek, Schmidt & Vöckler GbR, Leipzig Printed on acid-free paper
45/3100/YL
543210
To Eva, Leon, Benna, and Zimba
Foreword
Rigorously proven upper and lower run-time bounds for simplified evolutionary algorithms on artificial optimization problems on the one hand and endless tables of benchmark results for real-world algorithms on today’s or yesterday’s hardware on the other, is that all one can do to justify their invention, existence, or even spreading use? Thomas Bartz-Beielstein gives thoughtful answers to such questions that have bothered him since he joined the team of researchers at the Chair of Systems Analysis within the Department of Computer Science at the University of Dortmund. He brings together recent results fr
Data Loading...
