
Stochastic Local Search
Foundations and Applications
Series: The Morgan Kaufmann Series in Artificial Intelligence;
- Publisher's listprice EUR 68.95
-
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 5 850 Ft off)
- Discounted price 23 398 Ft (22 284 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
29 248 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Morgan Kaufmann
- Date of Publication 28 September 2004
- ISBN 9781558608726
- Binding Hardback
- No. of pages658 pages
- Size 234x190 mm
- Weight 1450 g
- Language English 0
Categories
Long 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:
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
More