Combinatorial Search: From Algorithms to Systems

Language: English

Published by Springer, Springer Aug 2016, 2016

366251429X / 9783662514290

  • Softcover
  • New
See all details

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

5-star seller

AbeBooks seller since January 23, 2017

View this seller's items
Softcover

Condition: New

£ 47.38

£ 51.60 shipping 
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 156 pp. Englisch.…

Seller Inventory # 9783662514290

Title
Combinatorial Search: From Algorithms to Systems
Author
Youssef Hamadi
Publisher
Springer, Springer Aug 2016
Publication year
2016
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
366251429X
ISBN 13
9783662514290
Item weight
248 grams
Dimensions
235x155x9 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Germany

5-star seller

AbeBooks seller since January 23, 2017

Shipping rates from Germany to U.S.A.

Item60 to 60 business days60 to 60 business days
First item£ 51.60£ 64.50
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check
  • Paypal

Store description

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specialty

Modernes Antiquariat - Bücher von 1960 bis heute

Seller's business information

buchversandmimpf2000

Germany