Neutrality in the Graph Coloring Problem
In this paper, the neutrality of some hard instances of the graph coloring problem (GCP) is quantified. This neutrality property has to be detected as it impacts the search process. Indeed, local optima may belong to plateaus that represent a barrier for
- PDF / 14,058,820 Bytes
- 483 Pages / 439.37 x 666.142 pts Page_size
- 2 Downloads / 237 Views
Giuseppe Nicosia Panos Pardalos (Eds.)
Learning and Intelligent Optimization 7th International Conference, LION 7 Catania, Italy, January 7–11, 2013 Revised Selected Papers
123
Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
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 Alfred Kobsa University of California, Irvine, CA, 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 TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany For further volumes: http://www.springer.com/series/7407
7997
Giuseppe Nicosia Panos Pardalos (Eds.) •
Learning and Intelligent Optimization 7th International Conference, LION 7 Catania, Italy, January 7–11, 2013 Revised Selected Papers
123
Editors Giuseppe Nicosia Department of Mathematics and Computer Science University of Catania Catania Italy
ISSN 0302-9743 ISBN 978-3-642-44972-7 DOI 10.1007/978-3-642-44973-4
Panos Pardalos Department of Industrial and Systems Engineering University of Florida Gainesville, FL USA
ISSN 1611-3349 (electronic) ISBN 978-3-642-44973-4 (eBook)
Springer Heidelberg New York Dordrecht London Library of Congress Control Number: 2013955073 CR Subject Classification (1998): F.2, G.1.6, G.2, F.1, I.2, G.1 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues Springer-Verlag Berlin Heidelberg 2013 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations a
Data Loading...
