Author:
Elbassioni Khaled,Katriel Irit
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference17 articles.
1. Apt, K.R. (2003). Principles of Constraint Programming. Cambridge, UK: Cambridge University Press.
2. Beldiceanu, N., Katriel, I., & Thiel, S. (2004). Filtering algorithms for the same constraint. In CP-AI-OR 2004 of LNCS 3011, pages 65–79.
3. Bleuzen-Guernalec, N., & Colmerauer, A. (2000). Optimal narrowing of a block of sortings in optimal time. Constraints 5(1–2): 85–118.
4. Fukuda, K., & Matsui, T. (1994). Finding all the perfect matchings in bipartite graphs. Applied Mathematics Letters 7(1): 15–18.
5. Hebrard, E., Hnich, B., & Walsh, T. (2004). Super solutions in constraint programming. In CP-AI-OR 2004 of LNCS 3011, pages 157–172. , Berlin Heidelberg New York: Springer.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Robustness Analysis for VGG-16 Model in Image Classification of Post-Hurricane Buildings;2021 2nd International Conference on Big Data & Artificial Intelligence & Software Engineering (ICBASE);2021-09