✦ LIBER ✦

Tractable Structures for Constraint Satisfaction with

✍ Scribed by Dániel Marx

Publisher: Springer
Year: 2009
Tongue: English
Weight: 497 KB
Volume: 48
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-009-9248-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new tractable class of constraint sati

A new tractable class of constraint satisfaction problems

✍ Víctor Dalmau 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 340 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

Constraint Satisfaction Methods for Appl

Constraint Satisfaction Methods for Applications in Engineering

✍ E. Gelle; B.V. Faltings; D.E. Clément; I.F.C. Smith 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 246 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