Resource bounded and anytime approximation of belief function computations. (Q1399499): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Upper and Lower Probabilities Induced by a Multivalued Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transferable belief model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic argumentation systems: a new perspective on the dempster-shafer theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dempster's rule of combination is {\#}P-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic and quantitative approaches to reasoning and uncertainty. European conference, ECSQARU `99. London, GB, July 5-9, 1999. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computationally efficient approximation of Dempster-Shafer theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consonant approximations of belief functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary join trees for computing marginals in the Shenoy-Shafer architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertain evidence and artificial analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing belief function computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4292466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket elimination: A unifying framework for reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional information systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagating belief functions in qualitative Markov trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765523 / rank
 
Normal rank

Latest revision as of 17:44, 5 June 2024

scientific article
Language Label Description Also known as
English
Resource bounded and anytime approximation of belief function computations.
scientific article

    Statements

    Resource bounded and anytime approximation of belief function computations. (English)
    0 references
    0 references
    0 references
    30 July 2003
    0 references
    Belief functions
    0 references
    Dempster-Shafer theory
    0 references
    incompleteness
    0 references
    lower and upper approximation
    0 references
    join tree propagation
    0 references
    fusion algorithm
    0 references
    interruptible anytime algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers