Handling Arithmetic Binary and Non-Binary Constraints in Quantified Constraint Satisfaction Problems
Researchers have developed many strategies for solving combinatorial problems based on Constraint Satisfaction Problems (CSPs) ([5], [10], [12]). This approach has proved to be very effective in many real-world problems. Recently, the scientific community has started to take on a harder task, the on...
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | https://vsmart.lib.aegean.gr/webopac/FullBB.csp?WebAction=ShowFullBB&EncodedRequest=*FA*83F*E5o*9E*A3*ED*8D*F67*93*5D*0B*3E*08&Profile=Default&OpacLanguage=gre&NumberToRetrieve=50&StartValue=1&WebPageNr=1&SearchTerm1=2005%20.1.77116&SearchT1=&Index1=Keywordsbib&SearchMethod=Find_1&ItemNr=1 http://hdl.handle.net/11610/12499 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!