Approximation algorithms and decision ma
โ
Mathias Bauer
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 879 KB
The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the major points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that aim at reducing the number of focal elements in the belief