Parallel evidence combination on a SB-tree architecture

The paper presents a specialised parallel architecture and algorithms for the computation of Dempster's rule in evidential reasoning based on the Dempster-Shafer theory. The architecture is scalable and the complexity of the associated parallel algorithms is linear with respect to the number of processors. The approach supports efficient dynamic load balancing which is essential for incremental reasoning. The technique has been simulated on a UNIX based machine and can easily be implemented on a multiprocessor symmetric machine.

[1]  H.H.S. Ip,et al.  Evidential reasoning in foreign exchange rates forecasting , 1991, Proceedings First International Conference on Artificial Intelligence Applications on Wall Street.

[2]  David A. Bell,et al.  Improving Barnett's algorithm , 1994, Proceedings of ANZIIS '94 - Australian New Zealnd Intelligent Information Systems Conference.

[3]  Yung-Chang Wong,et al.  On Parallelizing the Dempster-Shafer Method Using Transputer Network , 1993, Parallel Comput..

[4]  Jeffrey A. Barnett,et al.  Computational Methods for a Mathematical Theory of Evidence , 1981, IJCAI.