Author of the publication

Computational Methods for a Mathematical Theory of Evidence.

. IJCAI, page 868-875. William Kaufmann, (1981)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Computational Methods for A Mathematical Theory of Evidence.. Classic Works of the Dempster-Shafer Theory of Belief Functions, volume 219 of Studies in Fuzziness and Soft Computing, Springer, (2008)Combining Opinions About the Order of Rule Execution.. AAAI, page 477-481. AAAI Press / The MIT Press, (1991)Dynamic Task-Level Voltage Scheduling Optimizations.. IEEE Trans. Computers, 54 (5): 508-520 (2005)A Wrinkle on Satisficing Search Problems., and . IJCAI, page 774-776. William Kaufmann, (1983)An AIer's Lament.. AI Mag., 6 (2): 54-56 (1985)Calculating Dempster-Shafer Plausibility.. IEEE Trans. Pattern Anal. Mach. Intell., 13 (6): 599-602 (1991)Garbage Collection versus Swapping.. ACM SIGOPS Oper. Syst. Rev., 13 (3): 12-17 (1979)Computational Methods for a Mathematical Theory of Evidence.. IJCAI, page 868-875. William Kaufmann, (1981)The LISP 2 programming language and system., , , , , , , , and . AFIPS Fall Joint Computing Conference, volume 29 of AFIPS Conference Proceedings, page 661-676. AFIPS / ACM / Spartan Books, Washington D.C., (1966)Optimal Satisficing Tree Searches., and . AAAI, page 441-445. AAAI Press / The MIT Press, (1991)