✦ LIBER ✦

Nogood-FC for solving partitionable constraint satisfaction problems

✍ Scribed by Montserrat Abril; Miguel A. Salido; Federico Barber

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 837 KB
Volume: 21
Category: Article
ISSN: 0956-5515
DOI: 10.1007/s10845-008-0168-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving set-valued constraint satisfacti

Solving set-valued constraint satisfaction problems

✍ Luc Jaulin 📂 Article 📅 2011 🏛 Springer Vienna 🌐 English ⚖ 403 KB

Solving partial constraint satisfaction

Solving partial constraint satisfaction problems with tree decomposition

✍ Arie M. C. A. Koster; Stan P. M. van Hoesel; Antoon W. J. Kolen 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Musical constraint satisfaction problems

Musical constraint satisfaction problems solved with adaptive search

✍ C. Truchet; P. Codognet 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 244 KB

Learning cluster-based structure to solv

Learning cluster-based structure to solve constraint satisfaction problems

✍ Xingjian Li; Susan L. Epstein 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 804 KB

Domain permutation reduction for constra

Domain permutation reduction for constraint satisfaction problems

✍ Martin J. Green; David A. Cohen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Backjump-based backtracking for constrai

Backjump-based backtracking for constraint satisfaction problems

✍ Rina Dechter; Daniel Frost 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 385 KB

The performance of backtracking algorithms for solving finite-domain constraint satisfaction problems can be improved substantially by look-back and look-ahead methods. Look-back techniques extract information by analyzing failing search paths that are terminated by dead-ends. Look-ahead techniques