Sampling Strategies and Variable Selection in Weighted Degree Heuristics-Reference-Cited by-同舟云学术

Sampling Strategies and Variable Selection in Weighted Degree Heuristics

Published: Issue: Volume: Page:831-838
ISSN:
Container-title:Principles and Practice of Constraint Programming – CP 2007
language:
Short-container-title:

Author:

Grimes Diarmuid,Wallace Richard J.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74970-7_61.pdf

Reference5 articles.

1. Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proc. Sixteenth European Conference on Artificial Intelligence-ECAI 2004, pp. 146–150 (2004)

2. Grimes, D., Wallace, R.J.: Learning from failure in constraint satisfaction search. In: Ruml, W., Hutter, F. (eds.) Learning for Search: Papers from the 2006 AAAI Workshop, pp. 24–31. Tech. Rep. WS-06-11 (2006)

3. Grimes, D., Wallace, R.J.: Learning to identify global bottlenecks in constraint satisfaction search. In: 20th International FLAIRS Conference (2007)

4. Lecture Notes in Computer Science;C. Eisenberg,2003

5. Lecture Notes in Artificial Intelligence;J.C. Beck,2005

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

1. Problem Specific Variable Selection Rules for Constraint Programming: A Type II Mixed Model Assembly Line Balancing Problem Case;Applied Artificial Intelligence;2020-02-26

2. Perturbing Branching Heuristics in Constraint Solving;Lecture Notes in Computer Science;2020

3. Explanation-Based Weighted Degree;Integration of AI and OR Techniques in Constraint Programming;2017

4. Revisiting restricted path consistency;Constraints;2016-09-14

5. A Hybrid Paradigm for Adaptive Parallel Search;Lecture Notes in Computer Science;2012