๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Compiling constraint satisfaction problems

โœ Scribed by Rainer Weigel; Boi Faltings


Book ID
108307076
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
682 KB
Volume
115
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Backjump-based backtracking for constrai
โœ 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