• usp_easy_retunsFree & Easy Returns
  • usp_best_dealsBest Deals
placeholder
Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems
placeholder
Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems
magnifyZoom

Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems

78.00
nudge icon
Free Delivery
nudge icon
Free Delivery
noon-marketplace
Get it by 27 Dec
Order in 15h32m
Product Overview

Specifications

PublisherLulu.com; First Edition
ISBN 101329010094
AuthorAnastasia Paparrizou
LanguageEnglish
Number of Pages166 pages
ISBN 139781329010093
Book DescriptionConstraint programming is a successful technology for solving a wide range of problems in business and industry which require satisfying a set of constraints. Central to solving constraint satisfaction problems is enforcing a level of local consistency. In this thesis, we propose efficient filtering algorithms for enforcing strong local consistencies. In addition, since such filtering algorithms can be too expensive to enforce all the time, we propose some automated heuristics that can dynamically select the most appropriate filtering algorithm. Published by AI Access, a not-for-profit publisher of open access texts with a highly respected scientific board. We publish monographs and collected works. Our texts are available electronically for free and in hard copy at close to cost.
Book FormatPaperback
Publication Date23 March 2015
Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems
Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems
78.00
0

We're Always Here To Help

Reach out to us through any of these support channels

Shop On The Go

Connect With Us

mastercardvisatabbytamaraamexcod