2084 search results - page 214 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
117
Voted
SPAA
1995
ACM
15 years 1 months ago
1995
ACM
For years, the computation rate of processors has been much faster than the access rate of memory banks, and this divergence in speeds has been constantly increasing in recent yea...
104
Voted
AI
2002
Springer
14 years 10 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
RTS
2006
14 years 10 months ago
2006
Many of today's complex computer applications are being modeled and constructed using the principles inherent to real-time distributed object systems. In response to this dem...