Close
Enter your search into one or more of the boxes below:
You can refine your search by selecting from any of the options below:
Search
Combinatorial Search: From Algorithms to Systems

Combinatorial Search: From Algorithms to Systems (Hardback)

£76.00
Usually despatched within 2 weeks.
Order now for Free delivery in the UK.
More on delivery...

Synopsis

Although they are believed to be unsolvable in general, tractability results suggest that some practical NP-hard problems can be efficiently solved. Combinatorial search algorithms are designed to efficiently explore the usually large solution space of these instances by reducing the search space to feasible regions and using heuristics to efficiently explore these regions. Various mathematical formalisms may be used to express and tackle combinatorial problems, among them the constraint satisfaction problem (CSP) and the propositional satisfiability problem (SAT). These algorithms, or constraint solvers, apply search space reduction through inference techniques, use activity-based heuristics to guide exploration, diversify the searches through frequent restarts, and often learn from their mistakes.In this book the author focuses on knowledge sharing in combinatorial search, the capacity to generate and exploit meaningful information, such as redundant constraints, heuristic hints, and performance measures, during search, which can dramatically improve the performance of a constraint solver. Information can be shared between multiple constraint solvers simultaneously working on the same instance, or information can help achieve good performance while solving a large set of related instances. In the first case, information sharing has to be performed at the expense of the underlying search effort, since a solver has to stop its main effort to prepare and communicate the information to other solvers; on the other hand, not sharing information can incur a cost for the whole system, with solvers potentially exploring unfeasible spaces discovered by other solvers. In the second case, sharing performance measures can be done with little overhead, and the goal is to be able to tune a constraint solver in relation to the characteristics of a new instance - this corresponds to the selection of the most suitable algorithm for solving a given instance. The book is suitable for researchers, practitioners, and graduate students working in the areas of optimization, search, constraints, and computational complexity.

Computing & ITComputer scienceArtificial intelligence Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Publication Date: 31/10/2013 ISBN-13: 9783642414817  Details: Type: Hardback Format: Books
Availability: Usually despatched within 2 weeks. Login for Quick Checkout Add to Basket

Dr. Youssef Hamadi is the head of the Constraint Reasoning Group at Microsoft Research Cambridge, and his research interests include combinatorial optimization in alternative frameworks (parallel and distributed architectures); the application of machine learning to search; autonomous search; and parallel propositional satisfiability.

More books by Youssef Hamadi

Leave Review

Delivery

Delivery Options

All delivery times quoted are the average, and cannot be guaranteed. These should be added to the availability message time, to determine when the goods will arrive. During checkout we will give you a cumulative estimated date for delivery.

Location 1st Book Each additional book Average Delivery Time
UK Standard Delivery FREE FREE 3-5 Days
UK First Class £4.50 £1.00 1-2 Days
UK Courier £7.00 £1.00 1-2 Days
Western Europe** Courier £17.00 £3.00 2-3 Days
Western Europe** Airmail £5.00 £1.50 4-14 Days
USA / Canada Courier £20.00 £3.00 2-4 Days
USA / Canada Airmail £7.00 £3.00 4-14 Days
Rest of World Courier £22.50 £3.00 3-6 Days
Rest of World Airmail £8.00 £3.00 7-21 Days

** Includes Austria, Belgium, Denmark, France, Germany, Greece, Iceland, Irish Republic, Italy, Luxembourg, Netherlands, Portugal, Spain, Sweden and Switzerland.

Delivery Help & FAQs

Returns Information

If you are not completely satisfied with your purchase*, you may return it to us in its original condition with in 30 days of receiving your delivery or collection notification email for a refund. Except for damaged items or delivery issues the cost of return postage is borne by the buyer. Your statutory rights are not affected.

* For Exclusions and terms on damaged or delivery issues see Returns Help & FAQs

You might also like

Safe City: From Law Enforcement to...
(Paperback)
Robert Hessel
 
 
£10.95
 

Currently out of stock

Introduction to Deep Learning: From...
(Paperback)
Sandro Skansi
 
 
£26.99
 
Is Intelligence an Algorithm?
(Paperback)
Antonin Tuynman
 
 
£11.99
 
Language, Cognition, and ...
(Hardback)
Thierry Poibeau; Aline Villavicencio
 
 
£64.99
 
Latest Blog
A Tale of Two Currencies
23/02/2018

Dharshini David explains why the volatility of Bitcoin underscores how secure the dollar is in its pole position – and how the old greenback continues to dictate the world’s fortunes.

#FoylesFive: Polish Fiction
22/02/2018

Gary from our Fiction Department delights us with a few of his favourite Polish novels.

Get More!
22/02/2018

We've extended the range of available lines on our website to close to one million items across more than thirty product categories! OK, that actually sounds quite dull. But what it means is you've got more books to choose from, more subject areas, more titles available on our website than ever before — more more more! To celebrate, we're giving you 15% off everything* online when you use the code GETMORE at checkout anytime between Thursday 22nd February and Thursday 1st March 2018.

View all Blog Entries
Twitter
Show/Hide Tweets
© W&G Foyle Ltd