๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bounds of the Overflow Priority Classification for Blocking Probability Approximation in OBS Networks

โœ Scribed by Li, Shuo; Wang, Meiqian; Wong, Eric W. M.; Abramov, Vyacheslav; Zukerman, Moshe

Book ID
121346194
Publisher
The Optical Society
Year
2013
Tongue
English
Weight
572 KB
Volume
5
Category
Article
ISSN
1943-0620

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The complexity of approximating MAPs for
The complexity of approximating MAPs for belief networks with bounded probabilities
โœ Ashraf M. Abdelbar; Stephen T. Hedetniemi; Sandra M. Hedetniemi ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 69 KB

Probabilistic inference and maximum a posteriori (MAP) explanation are two important and related problems on Bayesian belief networks. Both problems are known to be NP-hard for both approximation and exact solution. In 1997, Dagum and Luby showed that efficiently approximating probabilistic inferenc