Constraint satisfaction problems : backtrack search revisited
暂无分享,去创建一个
[1] Christian Bessiere,et al. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.
[2] Solomon W. Golomb,et al. Backtrack Programming , 1965, JACM.
[3] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[4] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[5] Yishai A. Feldman,et al. Portability by automatic translation: a large-scale case study , 1999 .
[6] Christian Bessiere,et al. Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..
[7] Christian Bessiere,et al. Using Constraint Metaknowledge to Reduce Arc Consistency Computation , 1999, Artif. Intell..
[8] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..
[9] Barbara M. Smith,et al. Trying Harder to Fail First , 1998, ECAI.
[10] Fahiem Bacchus,et al. Extending Forward Checking , 2000, CP.
[11] Eugene C. Freuder,et al. Understanding and Improving the MAC Algorithm , 1997, CP.
[12] Edward M. Reingold,et al. Backtrack programming techniques , 1975, CACM.
[13] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[14] Philippe Jégou,et al. Efficient Path-Consistency Propagation , 1998, Int. J. Artif. Intell. Tools.
[15] Eugene C. Freuder,et al. Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.
[16] Marc R. C. van Dongen,et al. AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity , 2002, CP.