Fast Markov Chain Algorithms for Calculating Dempster-Shafer Belief.
Nic Wilson, Serafı́n Moral · 1996
Abstract. We present a new type of Markov Chain algorithm for the calculation of combined Dempster-Shafer belief which is almost linear in the size of the frame, thus making the calculation of belief feasible for a wider range of problems. We also indicate how these algorithms may be used in the calculation of belief in product spaces associated with networks. 1