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 anastasia paparrizou university of western macedonia. As the simultaneous satisfaction of different constraints is intractable in general problems can become very difficult to solve as their size increases cp has thus developed various techniques to tackle this inherent problem enforcing a local consistency property is one of the most important such techniques. Constraint programming cp is a successful technology for solving a wide range of problems in business and industry which require the satisfaction of a set of complex constraints examples include product configuration resource allocation transportation and scheduling as the simultaneous satisfaction of different constraints is intractable in general problems can become very difficult to . In non binary constraint satisfaction problems the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local
How it works:
1. Register a Free 1 month Trial Account.
2. Download as many books as you like ( Personal use )
3. No Commitment. Cancel anytime.
4. Join Over 100.000 Happy Readers.
5. That's it. What you waiting for? Sign Up and Get Your Books.