Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Nahla Ben Amor, Salem Benferhat, Khaled Mellouli. Anytime propagation algorithm for min-based possibilistic graphs. Soft Comput., 8(2):150-161, 2003. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Anytime Possibilistic Propagation AlgorithmNahla Ben Amor, Salem Benferhat, Khaled Mellouli. software 2002: 263-279 [doi] An Approximate Propagation Algorithm for Product-Based Possibilistic NetworksAmen Ajroud, Mohamed-Nazih Omri, Salem Benferhat, Habib Youssef. ICEIS 2007: 321-326 An Approximate Algorithm for Min-Based Possibilistic NetworksAmen Ajroud, Salem Benferhat. ijis, 29(7):615-633, 2014. [doi]
The following publications are possibly variants of this publication: