Sciweavers

244 search results - page 25 / 49
» On-Line Probability, Complexity and Randomness
Sort
View
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
13 years 8 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
HICSS
2008
IEEE
105views Biometrics» more  HICSS 2008»
13 years 9 months ago
Evaluating the Effect of Upgrade, Control and Development Strategies on Robustness and Failure Risk of the Power Transmission Gr
We use the OPA complex systems model of the power transmission system to investigate the effect of a series of different network upgrade scenarios on the long time dynamics and th...
David E. Newman, Benjamin A. Carreras, Vickie E. L...
FTML
2008
185views more  FTML 2008»
13 years 9 months ago
Graphical Models, Exponential Families, and Variational Inference
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate stat...
Martin J. Wainwright, Michael I. Jordan
AC
2003
Springer
14 years 2 months ago
The Importance of Aggregation
Abstract—The dynamics of the survival of recruiting fish are analyzed as evolving random processes of aggregation and mortality. The analyses draw on recent advances in the phys...
Robbert van Renesse
ICALP
2010
Springer
13 years 10 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...