Anytime Propagation Algorithm for Min-based Possibilistic Graphs. Soft Computing, A fusion of foundations, methodologies and applications. Springer-Verlag

Nahla Ben Amor; Salem Benferhat; K Mellouli

Journal Articles Soft Computing - A Fusion of Foundations, Methodologies and Applications Year : 2003

Anytime Propagation Algorithm for Min-based Possibilistic Graphs. Soft Computing, A fusion of foundations, methodologies and applications. Springer-Verlag

(1) , (2) ,

1
2

Nahla Ben Amor

Function : Author

Laboratoire de Recherche Opérationnelle de Décision et de Contrôle de Processus

Salem Benferhat

Function : Author
PersonId : 868339
IdHAL : salem-benferhat
ORCID : 0000-0002-4853-3637
IdRef : 084578378

Centre de Recherche en Informatique de Lens

K Mellouli

Function : Author

Domains

Artificial Intelligence [cs.AI]

Fabien DELORME : Connect in order to contact the contributor

https://hal-univ-artois.archives-ouvertes.fr/hal-03299556

Submitted on : Monday, July 26, 2021-3:24:34 PM

Last modification on : Friday, March 24, 2023-2:53:22 PM

Dates and versions

hal-03299556 , version 1 (26-07-2021)

Identifiers

HAL Id : hal-03299556 , version 1

Cite

Nahla Ben Amor, Salem Benferhat, K Mellouli. Anytime Propagation Algorithm for Min-based Possibilistic Graphs. Soft Computing, A fusion of foundations, methodologies and applications. Springer-Verlag. Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2003, 8, pp.150-161. ⟨hal-03299556⟩

Anytime Propagation Algorithm for Min-based Possibilistic Graphs. Soft Computing, A fusion of foundations, methodologies and applications. Springer-Verlag

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share