大葉大學圖書館 |

Stochastic local search[electronic resource] :foundations and applications /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	519.6
書名/作者:	Stochastic local search : foundations and applications // Holger H. Hoos, Thomas St�utzle.
作者:	Hoos, Holger H.
其他作者:	St�utzle, Thomas.
出版者:	San Francisco, CA : : Morgan Kaufmann Publishers,, c2005.
面頁冊數:	1 online resource (xiii, 658 p.) : : ill.
標題:	Stochastic programming.
標題:	Algorithms.
標題:	Combinatorial analysis.
標題:	Programmation stochastique.
標題:	Algorithmes.
標題:	Analyse combinatoire.
ISBN:	9781558608726
ISBN:	1558608729
書目註:	Includes bibliographical references (p. 575-631) and index.
內容註:	SLS methods -- Generalised local search machines -- Empirical analysis of SLS algorithms -- Search space structure and SLS performance -- Propositional satisfiability and constraint satisfaction -- MAX-SAT and MAX-CSP -- Travelling salesman problems -- Scheduling problems -- Other combinatorial problems.
摘要、提要註:	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�utzle 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. Provides the first unified view of the field. Offers an extensive review of state-of-the-art stochastic local search algorithms and their applications. Presents and applies an advanced empirical methodology for analyzing the behavior of SLS algorithms. A companion website offers lecture slides as well as source code and Java applets for exploring and demonstrating SLS algorithms.
電子資源:	http://www.sciencedirect.com/science/book/9781558608726

Stochastic local search[electronic resource] :foundations and applications /
Hoos, Holger H.

Stochastic local searchfoundations and applications /[electronic resource] :Holger H. Hoos, Thomas St�utzle. - San Francisco, CA :Morgan Kaufmann Publishers,c2005. - 1 online resource (xiii, 658 p.) :ill.

Includes bibliographical references (p. 575-631) and index.

SLS methods -- Generalised local search machines -- Empirical analysis of SLS algorithms -- Search space structure and SLS performance -- Propositional satisfiability and constraint satisfaction -- MAX-SAT and MAX-CSP -- Travelling salesman problems -- Scheduling problems -- Other combinatorial problems.

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�utzle 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. *Provides the first unified view of the field. *Offers an extensive review of state-of-the-art stochastic local search algorithms and their applications. *Presents and applies an advanced empirical methodology for analyzing the behavior of SLS algorithms. *A companion website offers lecture slides as well as source code and Java applets for exploring and demonstrating SLS algorithms.

ISBN: 9781558608726

Source: 97253:97253Elsevier Science & Technologyhttp://www.sciencedirect.comSubjects--Topical Terms:

445598
Stochastic programming.
Index Terms--Genre/Form:

336502
Electronic books.

LC Class. No.: T57.79 / .H66 2005eb

Dewey Class. No.: 519.6

Stochastic local search[electronic resource] :foundations and applications /
LDR:02977cam 2200325Ia 4500 001 353366
003 OCoLC
005 20111122091349.0
006 m d
007 cr cn|||||||||
008 120110s2005 caua ob 001 0 eng d
020 $a 9781558608726
020 $a 1558608729
029 1 $a NZ1 $b 12435723
035 $a (OCoLC)162716320
035 $a ocn162716320
037 $a 97253:97253 $b Elsevier Science & Technology $n http://www.sciencedirect.com
040 $a OPELS $b eng $c OPELS $d OKU $d OCLCQ
049 $a TEFA
050 4 $a T57.79 $b .H66 2005eb
082 0 4 $a 519.6 $2 22
100 1 $a Hoos, Holger H. $3 445596
245 1 0 $a Stochastic local search $h [electronic resource] : $b foundations and applications / $c Holger H. Hoos, Thomas St�utzle.
260 $a San Francisco, CA : $b Morgan Kaufmann Publishers, $c c2005.
300 $a 1 online resource (xiii, 658 p.) : $b ill.
504 $a Includes bibliographical references (p. 575-631) and index.
505 0 $a SLS methods -- Generalised local search machines -- Empirical analysis of SLS algorithms -- Search space structure and SLS performance -- Propositional satisfiability and constraint satisfaction -- MAX-SAT and MAX-CSP -- Travelling salesman problems -- Scheduling problems -- Other combinatorial problems.
520 $a 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�utzle 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. *Provides the first unified view of the field. *Offers an extensive review of state-of-the-art stochastic local search algorithms and their applications. *Presents and applies an advanced empirical methodology for analyzing the behavior of SLS algorithms. *A companion website offers lecture slides as well as source code and Java applets for exploring and demonstrating SLS algorithms.
588 $a Description based on print version record.
650 0 $a Stochastic programming. $3 445598
650 0 $a Algorithms. $3 182797
650 0 $a Combinatorial analysis. $3 445599
650 6 $a Programmation stochastique. $3 445600
650 6 $a Algorithmes. $3 404650
650 6 $a Analyse combinatoire. $3 445601
655 4 $a Electronic books. $2 local $3 336502
700 1 $a St�utzle, Thomas. $3 445597
776 0 8 $i Print version: $a Hoos, Holger H. $t Stochastic local search. $d San Francisco, CA : Morgan Kaufmann Publishers, c2005 $z 1558608729 $z 9781558608726 $w (DLC) 2004019306 $w (OCoLC)56324167
856 4 0 $3 ScienceDirect $u http://www.sciencedirect.com/science/book/9781558608726
994 $a C0 $b TEF