Author:
Pesant Gilles,Meel Kuldeep S.,Mohammadalitajrishi Mahshid
Publisher
Springer International Publishing
Reference21 articles.
1. Lecture Notes in Computer Science;S Bardin,2010
2. Beldiceanu, N., Carlsson, M., Demassey, S., Petit, T.: Global constraint catalogue: past, present and future. Constraints Int. J. 12(1), 21–62 (2007). https://doi.org/10.1007/s10601-006-9010-8
3. Carter, J.L., Wegman, M.N.: Universal classes of hash functions. In: ACM Symposium on Theory of Computing, pp. 106–112. ACM (1977)
4. Chakraborty, S., Meel, K.S., Mistry, R., Vardi, M.Y.: Approximate probabilistic inference via word-level counting. In: Proceedings of AAAI (2016)
5. Lecture Notes in Computer Science;S Chakraborty,2013
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Solution sampling with random table constraints;Constraints;2022-06-24
2. Practically Uniform Solution Sampling in Constraint Programming;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022