Sciweavers

2200 search results - page 81 / 440
» Bloch's Constant is Computable
Sort
View
HASE
1998
IEEE
15 years 2 months ago
Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
Fault trees provide a graphical and logical framework for analyzing the reliability of systems. A fault tree provides a conceptually simple modeling framework to represent the sys...
Ragavan Manian, Joanne Bechta Dugan, David Coppit,...
NIPS
2004
14 years 11 months ago
Probabilistic Computation in Spiking Populations
As animals interact with their environments, they must constantly update estimates about their states. Bayesian models combine prior probabilities, a dynamical model and sensory e...
Richard S. Zemel, Quentin J. M. Huys, Rama Nataraj...
DC
2008
14 years 10 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 10 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CORR
2008
Springer
119views Education» more  CORR 2008»
14 years 10 months ago
Self-stabilizing Numerical Iterative Computation
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal proces...
Ezra N. Hoch, Danny Bickson, Danny Dolev