Dynamic variable ordering in CSPs-Reference-Cited by-同舟云学术

Dynamic variable ordering in CSPs

Published:1995 Issue: Volume: Page:258-275
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming — CP '95
language:
Short-container-title:

Author:

Bacchus Fahiem,Run Paul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60299-2_16.pdf

Reference16 articles.

1. J. R. Bitner and Reingold E. Backtracking programming techniques. Communications of the ACM, 18(11):651–656, 1975.

2. Fahiem Bacchus and Adam Grove. On the Forward Checking algorithm. In First International Conference on Principles and Practice of Constraint Programming (CP95), 1995.

3. R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence, 41:273–312, 1990.

4. R. Dechter and Itay Meiri. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence, 68:211–241, 1994.

5. M. J. Dent and R. E. Mercer. Minimal forward checking. In 6th IEEE International Conference on Tools with Artificial Intelligence, pages 432–438, New Orleans, 1994. Available via anonymous ftp from ftp://csd.uwo.ca/pub/csdtechnical-reports/374/tai94.ps.z.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments;ICGA Journal;2019-06-14

2. Bibliography;Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems;2013-07-01

3. A subgraph isomorphism algorithm and its application to biochemical data;BMC Bioinformatics;2013-04

4. Towards 40 years of constraint reasoning;Progress in Artificial Intelligence;2012-02-09

5. Efficient algorithms for spatial configuration information retrieval;Knowledge-Based Systems;2009-08