Sciweavers

534 search results - page 32 / 107
» Power from Random Strings
Sort
View
PODS
2006
ACM
156views Database» more  PODS 2006»
16 years 2 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
ICDCN
2011
Springer
14 years 6 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
120
Voted
CORR
2012
Springer
210views Education» more  CORR 2012»
13 years 10 months ago
Topological phase transition in a network model with preferential attachment and node removal
Preferential attachment is a popular model of growing networks. We consider a generalized model with random node removal, and a combination of preferential and random attachment. U...
Heiko Bauke, Cristopher Moore, Jean-Baptiste Rouqu...
ICALP
2005
Springer
15 years 8 months ago
Discrete Random Variables over Domains
In this paper we initiate the study of discrete random variables over domains. Our work is inspired by work of Daniele Varacca, who devised indexed valuations as models of probabi...
Michael W. Mislove
NIPS
2008
15 years 3 months ago
On Computational Power and the Order-Chaos Phase Transition in Reservoir Computing
Randomly connected recurrent neural circuits have proven to be very powerful models for online computations when a trained memoryless readout function is appended. Such Reservoir ...
Benjamin Schrauwen, Lars Buesing, Robert A. Legens...