SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Fast algorithms for Dempster-Shafer theory
1 references·1 citing·9 second hop
Fast algorithms for Dempster-Shafer theory (2005)Fast algorithms for Dempster-Shafer theoryDempster's rule of combination is #P-complete (1990)Dempster's rule of combinatio…Toward Efficient Computation of the Dempster–Shafer Belief Theoretic Conditionals (2012)Toward Efficient Computation …Shafer-dempster reasoning with applications to multisensor target identification systems (1987)Advances in the Dempster-Shafer theory of evidence (1994)Approximation algorithms and decision making in the Dempster-Shafer theory of evidence — An empirical study (1997)A method for managing evidential reasoning in a hierarchical hypothesis space (1985)Implementing Dempster's rule for hierarchical evidence (1987)Algorithms for Dempster-Shafer Theory (2000)Belief rule-base inference methodology using the evidential reasoning Approach-RIMER (2006)Computational Methods for A Mathematical Theory of Evidence (2008)An optimization model for rescuer assignments under an uncertain environment by using Dempster–Shafer theory (2022)
this work references cited by second hop

References

  • 1990Dempster's rule of combination is #P-complete109 cited

Cited by

  • 2012Toward Efficient Computation of the Dempster–Shafer Belief Theoretic Conditionals27 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work