Sciweavers

3809 search results - page 643 / 762
» Randomized Broadcast in Networks
Sort
View
UAI
2004
13 years 11 months ago
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
Andres Madsen
BIOSYSTEMS
2007
109views more  BIOSYSTEMS 2007»
13 years 9 months ago
Protein folding and the robustness of cells
The intricate intracellular infrastructure of all known life forms is based on proteins. The folded shape of a protein determines both the protein’s function and the set of mole...
G. J. Shawn Tan, Ferran D. Revilla, Klaus-Peter Za...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 9 months ago
Efficient Algorithms and Routing Protocols for Handling Transient Single Node Failures
Single node failures represent more than 85% of all node failures in the today's large communication networks such as the Internet [10]. Also, these node failures are usually...
Amit M. Bhosle, Teofilo F. Gonzalez
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 9 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
COMCOM
2007
103views more  COMCOM 2007»
13 years 9 months ago
Inter-autonomous system provisioning for end-to-end bandwidth guarantees
This paper addresses the issue of provisioning end-to-end bandwidth guarantees across multiple Autonomous Systems (ASes). We first review a cascaded model for negotiating and est...
Kin-Hon Ho, Michael P. Howarth, Ning Wang, George ...