Sciweavers

25 search results - page 1 / 5
» Network Probabilistic Connectivity: Exact Calculation with U...
Sort
View
ICCSA
2004
Springer
13 years 10 months ago
Network Probabilistic Connectivity: Exact Calculation with Use of Chains
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
Olga K. Rodionova, Alexey S. Rodionov, Hyunseung C...
NETWORKING
2000
13 years 6 months ago
An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
Abstract. The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offere...
Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto
UAI
2000
13 years 6 months ago
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called probabilistic arc consistency, which is both a generalization of...
Michael C. Horsch, William S. Havens
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 4 months ago
Exact two-terminal reliability of some directed networks
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
Christian Tanguy
ICCSA
2004
Springer
13 years 10 months ago
Network Probabilistic Connectivity: Optimal Structures
Abstract. The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered...
Olga K. Rodionova, Alexey S. Rodionov, Hyunseung C...