1612 search results - page 137 / 323 » Analysing Randomized Distributed Algorithms |
108
Voted
SODA
2001
ACM
15 years 6 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
149
click to vote
NIPS
2003
15 years 6 months ago
2003
We present an analysis of concentration-of-expectation phenomena in layered Bayesian networks that use generalized linear models as the local conditional probabilities. This frame...
149
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
153
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
149
Voted
CONCUR
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. The ambient calculus is a calculus of computation that allows active processes (mobile ambients) to move between sites. A firewall is said to be protective whenever it d...