Author:
Szántai Tamás,Kovács Edith
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference18 articles.
1. Acid, S., & Campos, L. M. (1996a). BENEDICT: an algorithm for learning probabilistic networks. In 6-th international conference IPMU (pp. 979–984).
2. Acid, S., & Campos, L. M. (1996b). An algorithm for finding minimum d separating sets in belief networks. In Proceedings of 12th conference on uncertainty in artificial intelligence (pp. 3–10). San Mateo: Morgan Kaufman.
3. Bukszár, J. (2001). Upper bounds for the probability of union by multitrees. Advances in Applies Probability, 33, 437–452.
4. Bukszár, J., & Prékopa, A. (2001). Probability bounds with cherry trees. Mathematics of Operational Research, 26, 174–192.
5. Bukszár, J., & Szántai, T. (2002). Probability bounds given by hypercherry trees. Optimization Methods and Software, 17, 409–422.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献