Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems anastasia paparrizou university of western macedonia. Find new islands of tractability that is classes of csp instances for which polytime algorithms exist is a fundamental task in the study of constraint satisfaction problems. Request pdf on researchgate efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems constraint programming cp is a successful . The existing complete methods for solving constraint satisfaction problems csps are usually based on a combination of exhaustive search and constraint propagation techniques for the reduction of the search space such propagation techniques are the local consistency algorithms arc consistency ac . Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems by anastasia paparrizou cite bibtex full citation abstract international audienceconstraint programming cp is a successful technology for solving a wide range of problems in business and industry which require the
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.