國立虎尾科技大學 |

Stochastic local search = foundations and applications /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Stochastic local search/ Holger H. Hoos, Thomas St�utzle.
Reminder of title:	foundations and applications /
Author:	Hoos, Holger H.
other author:	St�utzle, Thomas.
Published:	San Francisco, CA :Morgan Kaufmann Publishers, : c2005.,
Description:	1 online resource (xiii, 658 p.) :ill. :
Subject:	Stochastic programming. -
Online resource:	http://www.sciencedirect.com/science/book/9781558608726
ISBN:	9781558608726

Stochastic local search = 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:

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

554714
Electronic books.

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

Dewey Class. No.: 519.6

Stochastic local search = foundations and applications /
LDR:02785cam 2200313Ia 4500 001 691497
003 OCoLC
005 20111122091349.0
006 m d
007 cr cn|||||||||
008 120103s2005 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 675310
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 528534
650 0 $a Algorithms. $3 527865
650 0 $a Combinatorial analysis. $3 527896
650 6 $a Programmation stochastique. $3 813132
650 6 $a Algorithmes. $3 813133
650 6 $a Analyse combinatoire. $3 813134
655 4 $a Electronic books. $2 local $3 554714
700 1 $a St�utzle, Thomas. $3 813131
856 4 0 $3 ScienceDirect $u http://www.sciencedirect.com/science/book/9781558608726
994 $a C0 $b TEF