Stochastic Local Search : Foundations & Applications
暫譯: 隨機局部搜尋:基礎與應用
Holger H. Hoos, Thomas Stützle
- 出版商: Morgan Kaufmann
- 出版日期: 2005-01-01
- 售價: $3,510
- 貴賓價: 9.5 折 $3,335
- 語言: 英文
- 頁數: 658
- 裝訂: Hardcover
- ISBN: 1558608729
- ISBN-13: 9781558608726
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$960$912 -
$680$646 -
$590$466 -
$750$638 -
$560$476 -
$650$514 -
$650$507 -
$620$490 -
$750$593 -
$780$616 -
$560$437 -
$680$646 -
$880$695 -
$550$435 -
$580$458 -
$790$624 -
$650$514 -
$780$741 -
$650$507 -
$550$435 -
$980$774 -
$620$527 -
$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
商品描述(中文翻譯)
**描述:**
隨機局部搜尋(Stochastic Local Search, SLS)演算法是解決計算上困難問題的最重要且成功的技術之一,應用於計算機科學和運籌學的許多領域,包括命題滿足性、約束滿足、路由和排程。SLS 演算法在解決許多應用領域中的挑戰性組合問題(如電子商務和生物資訊學)方面也變得越來越受歡迎。
Hoos 和 Stützle 提供了 SLS 演算法的首個系統性和統一性處理。在這本開創性的書中,他們檢視了 SLS 演算法的一般概念和具體實例,並仔細考慮其發展、分析和應用。討論重點集中在最成功的 SLS 方法上,並探討其基本原則、特性和特點。本書提供了一些最廣泛使用的搜尋技術的實作經驗,並為讀者提供必要的理解和技能,以使用這個強大的工具。
**目錄:**
序言
第一部分 基礎
1. 介紹
2. SLS 方法
3. 一般化局部搜尋機器
4. SLS 演算法的實證分析
5. 搜尋空間結構與 SLS 性能
第二部分 應用
6. SAT 和約束滿足
7. MAX-SAT 和 MAX-CSP
8. 旅行推銷員問題
9. 排程問題
10. 其他組合問題
後記
術語表