Stochastic Local Search
Foundations and Applications
Seiten
2004
Morgan Kaufmann Publishers In (Verlag)
978-1-55860-872-6 (ISBN)
Morgan Kaufmann Publishers In (Verlag)
978-1-55860-872-6 (ISBN)
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems. Offering a systematic treatment of SLS algorithms, this book examines the general concepts and specific instances of SLS algorithms and considers their development, analysis and application.
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.
Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool.
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.
Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the general concepts and specific instances of SLS algorithms and carefully consider their development, analysis and application. The discussion focuses on the most successful SLS methods and explores their underlying principles, properties, and features. This book gives hands-on experience with some of the most widely used search techniques, and provides readers with the necessary understanding and skills to use this powerful tool.
By Holger Hoos and Thomas Stutzle
Part I. Foundations1. Introduction2. SLS Methods3. Generalized Local Search Machines4. Empirical Analysis of SLS Algorithms5. Search Space Structure and SLS Performance
Part II. Applications6. SAT and Constraint Satisfaction7. MAX-SAT and MAX-CSP8. Traveling Salesman Problems9. Scheduling Problems10. Other Combinatorial Problems
| Erscheint lt. Verlag | 28.9.2004 |
|---|---|
| Reihe/Serie | The Morgan Kaufmann Series in Artificial Intelligence |
| Verlagsort | San Francisco |
| Sprache | englisch |
| Maße | 191 x 235 mm |
| Gewicht | 1450 g |
| Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
| ISBN-10 | 1-55860-872-9 / 1558608729 |
| ISBN-13 | 978-1-55860-872-6 / 9781558608726 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
REDLINE (Verlag)
CHF 27,95
Eine kurze Geschichte der Informationsnetzwerke von der Steinzeit bis …
Buch | Hardcover (2024)
Penguin (Verlag)
CHF 39,20
