𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Competition and complexity in spatially connected networks

✍ Scribed by Aura Reggiani; Peter Nijkamp

Book ID
112206259
Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
815 KB
Volume
11
Category
Article
ISSN
0883-7066

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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