Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

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

Document type :
Journal articles
Complete list of metadata

https://hal-univ-artois.archives-ouvertes.fr/hal-03299556
Contributor : Fabien DELORME Connect in order to contact the contributor
Submitted on : Monday, July 26, 2021 - 3:24:34 PM
Last modification on : Wednesday, October 20, 2021 - 9:58:21 AM

Identifiers

  • HAL Id : hal-03299556, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

7