Cart (Loading....) | Create Account
Close category search window
 

Using parallel techniques to improve the computational efficiency of evidential combination

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xin Hong ; Sch. of Inf. & Software Eng., Ulster Univ., Jordanstown, UK ; Adamson, K. ; Weiru Liu

This paper presents a method of partitioning a Markov tree of belief functions into clusters so as to efficiently implement parallel belief function propagations on the basis of the local computation technique. Our method initially represents computations of combining evidence on all nodes in a Markov tree as parallelism instances, then balances the computation load among these instances, and finally partitions them into clusters which can be mapped onto a set of processors in a PowerPC network. The advantage of our method is that the maximum parallelization can still be achieved, even with limited processor availability

Published in:

Tools with Artificial Intelligence, 1999. Proceedings. 11th IEEE International Conference on

Date of Conference:

1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.