par Kennes, Robert 
;Smets, Philippe
Référence Lecture notes in computer science, 521 LNCS, page (14-23)
Publication Publié, 1991
;Smets, Philippe Référence Lecture notes in computer science, 521 LNCS, page (14-23)
Publication Publié, 1991
Article révisé par les pairs
| Résumé : | The runtime of the usual algorithms computing the transformation of a basic belief assignment into its associated belief function and conversely is an exponential function of the cardinality of (the domain of) the basic belief assignment. In this paper, new algorithms with a polynomial runtime are presented. These algorithms appear to be optimal in the class of the so-called M-algorithms. |
