Author:
Li Xingjian,Epstein Susan L.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference40 articles.
1. Bessière, C., Chmeiss, A., Saîs, L.: Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. In: Proceedings of Principles and Practice of Constraint Programming (CP2001), Paphos, Cyprus, pp. 565–569 (2001)
2. Boussemart, F., et al.: Boosting systematic search by weighting constraints. In: Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI-2004), Valencia, Spain, pp. 146–150 (2004)
3. Cabon, R., et al.: Radio link frequency assignment. Constraints 4, 79–89 (1999)
4. Cambazard, H., Jussien, N.: Identifying and exploiting problem structures using explanation-based constraint programming. Constraints 11, 295–313 (2006)
5. Cohen, D.A., Green, M.J.: Typed guarded decompositions for constraint satisfaction. In: Proceedings of Principles and Practice of Constraint Programming (CP2006), Nantes, France, pp. 122–136 (2006)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献