460 search results - page 81 / 92 » Bounding the locality of distributed routing algorithms |
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
SIROCCO
2004
13 years 9 months ago
2004
Shareable data services providing consistency guarantees, such as atomicity (linearizability), make building distributed systems easier. However, combining linearizability with ef...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
CLUSTER
2001
IEEE
13 years 11 months ago
2001
IEEE
Using multiple independent networks (also known as rails) is an emerging technique to overcome bandwidth limitations and enhance fault tolerance of current high-performance parall...