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

Optimal Paths in Probabilistic Networks

โœ Scribed by D.D.M.L. Rasteiro; A.J.B. Anjo

Book ID
111595523
Publisher
Springer US
Year
2004
Tongue
English
Weight
173 KB
Volume
120
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal routing in shortest-path data ne
Optimal routing in shortest-path data networks
โœ K. G. Ramakrishnan; Manoel A. Rodrigues ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Institute of Electrical and Electronics Engineers ๐ŸŒ English โš– 249 KB ๐Ÿ‘ 1 views
Optimal data gathering paths and energy-
Optimal data gathering paths and energy-balance mechanisms in wireless networks
โœ Aubin Jarry; Pierre Leone; Sotiris Nikoletseas; Jose Rolim ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 990 KB

This paper studies the data gathering problem in wireless networks, where data generated at the nodes has to be collected at a single sink. We investigate the relationship between routing optimality and fair resource management. In particular, we prove that for energy-balanced data propagation, Pare

Complexity of probabilistic reasoning in
Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
โœ Solomon E Shimony; Carmel Domshlak ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 249 KB

Directed-path (DP) singly-connected Bayesian networks are an interesting special case that, in particular, includes both polytrees and two-level networks. We analyze the computational complexity of these networks. The prediction problem is shown to be easy, as standard message passing can perform co