1434 search results - page 178 / 287 » Distributed Computing with Imperfect Randomness |
WSC
2004
15 years 3 months ago
2004
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
155
Voted
CL
2007
Springer
15 years 2 months ago
2007
Springer
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...
114
click to vote
CORR
2000
Springer
15 years 2 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
183
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
138
click to vote
MSWIM
2009
ACM
15 years 9 months ago
2009
ACM
Wireless sensor networks have attracted increasing attentions considering their potentials for being widely adopted in both emerging civil and military applications. A common prac...