✦ LIBER ✦

Anytime propagation algorithm for min-based possibilistic graphs

✍ Scribed by N. Ben Amor; S. Benferhat; K. Mellouli

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exponential time improvement for min-wis

✍ Guy Feigenblat; Ely Porat; Ariel Shiftan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Graph-based data structures for skeleton

✍ Suárez, J. P. ;Carey, G. F. ;Plaza, A. 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

Optimized cluster-based filtering algori

✍ Haifeng Liu; Zhaohui Wu; Milenko Petrovic; Hans-Arno Jacobsen 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 615 KB

Extensions of Certain Graph-based Algori

✍ Fritzsche, David; Frommer, Andreas; Szyld, Daniel B. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 313 KB

Edge crossing minimization algorithm for

✍ Shen Wei-xiang; Huang Jing-wei 📂 Article 📅 2001 🏛 Wuhan University 🌐 English ⚖ 486 KB

A back propagation through time-like min

✍ Vladimir Milić; Josip Kasać; Dubravko Majetić 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB