Stochastic Local Search : Foundations & Applications
Holger H. Hoos, Thomas Stützle
- 出版商: Morgan Kaufmann
- 出版日期: 2005-01-01
- 售價: $3,450
- 貴賓價: 9.5 折 $3,278
- 語言: 英文
- 頁數: 658
- 裝訂: Hardcover
- ISBN: 1558608729
- ISBN-13: 9781558608726
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$960$912 -
$680$646 -
$590$466 -
$750$675 -
$560$504 -
$650$553 -
$650$507 -
$620$527 -
$750$593 -
$780$616 -
$560$437 -
$680$646 -
$880$581 -
$550$468 -
$580$493 -
$790$672 -
$650$553 -
$780$741 -
$650$507 -
$550$468 -
$980$774 -
$620$558 -
$720$569 -
$600$480 -
$850$723
相關主題
商品描述
Description:
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.
Table of Contents:
Prologue
Part I. Foundations
1. Introduction
2. SLS Methods
3. Generalised Local Search Machines
4. Empirical Analysis of SLS Algorithms
5. Search Space Structure and SLS Performance
Part II. Applications
6. SAT and Constraint Satisfaction
7. MAX-SAT and MAX-CSP
8. Travelling Salesman Problems
9. Scheduling Problems
10. Other Combinatorial Problems
Epilogue
Glossary