Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
"Bioinspired computing is successful in practice. Over the past decade a body of theory for bioinspired computing has been developed. The authors have contributed significantly to this body and give a highly readable account of it." (Kurt Mehlhorn, Max Planck Institute for Informatics, and Saarland University, Germany)
"Bioinspired algorithms belong to the most powerful methods used to tackle real world optimization problems. This book gives such algorithms a solid foundation. It presents some of the most exciting results that have been obtained in bioinspired computing in the last decade." (Zbigniew Michalewicz, University of Adelaide, Australia)
"This book presents a most welcome theoretical computer science approach and perspective to the design and analysis of discrete evolutionary algorithms. It describes the design and derivation of evolutionary algorithms which have precise computation complexity bounds for combinatorial optimization. The book should appeal to researchers and practitioners of evolutionary algorithms and computation who want to learn the state of the art in evolutionary algorithm theory." (Una-May O'Reilly, CSAIL, MIT, USA)
"The evolutionary computation community has been in need of rigorous results concerning the computational complexity of their approaches for decades. This is the first textbook covering such a fundamental topic. It provides an excellent overview of the state of the art in this research area, in terms of both the results obtained and the analytical methods. It is an indispensable book for everyone who is interested in the foundations of evolutionary computation." (Xin Yao, University of Birmingham, UK)
Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area.
The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.
This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Versand:
Gratis
Innerhalb der USA
Buchbeschreibung Hardcover. Zustand: new. Bestandsnummer des Verkäufers 9783642165436
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020219843
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Hardback or Cased Book. Zustand: New. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity 0.74. Book. Bestandsnummer des Verkäufers BBS-9783642165436
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9783642165436_lsuk
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field. 228 pp. Englisch. Bestandsnummer des Verkäufers 9783642165436
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Hardcover. Zustand: Brand New. 216 pages. 9.00x6.00x0.75 inches. In Stock. Bestandsnummer des Verkäufers x-3642165435
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. This book shows how runtime behavior can be analyzed in a rigorous way and for combinatorial optimization in particular. It presents well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems. Series: Natural Computing Series. Num Pages: 228 pages, biography. BIC Classification: PBU; UMB; UYQ. Category: (P) Professional & Vocational. Dimension: 181 x 258 x 16. Weight in Grams: 530. . 2010. 2010th Edition. Hardcover. . . . . Bestandsnummer des Verkäufers V9783642165436
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area. The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial optimization problems -- minimum spanning trees, shortest paths, maximum matching, covering and scheduling problems. A feature of the book is the separate treatment of single- and multiobjective problems, the latter a domain where the development of the underlying theory seems to be lagging practical successes.This book will be very valuable for teaching courses on bioinspired computation and combinatorial optimization. Researchers will also benefit as the presentation of the theory covers the most important developments in the field over the last 10 years. Finally, with a focus on well-studied combinatorial optimization problems rather than toy problems, the book will also be very valuable for practitioners in this field. Bestandsnummer des Verkäufers 9783642165436
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Gebunden. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Authors have given tutorials on this topic at major international conferencesText has been class-tested by the authors and their collaboratorsComprehensive introduction for researchers Bioinspired computing is successful in pract. Bestandsnummer des Verkäufers 5051184
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. This book shows how runtime behavior can be analyzed in a rigorous way and for combinatorial optimization in particular. It presents well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems. Series: Natural Computing Series. Num Pages: 228 pages, biography. BIC Classification: PBU; UMB; UYQ. Category: (P) Professional & Vocational. Dimension: 181 x 258 x 16. Weight in Grams: 530. . 2010. 2010th Edition. Hardcover. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9783642165436
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren