We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
This paper proposes two new algorithms for inference in credal networks. These algorithms
enable probability intervals to be obtained for the states of a given query variable. The first
algorithm is approximate and uses the hill-climbing technique in the Shenoy–Shafer architecture
to propagate in join trees; the second is exact and is a modification of Rocha and Cozman’s
branch-and-bound algorithm, but applied to general directed acyclic graphs.TIN2004-06204-C03-0
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.