460 search results - page 63 / 92 » Bounding the locality of distributed routing algorithms |
141
click to vote
PODC
2011
ACM
14 years 15 days 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...
88
Voted
IPCO
2010
14 years 11 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
77
Voted
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
86
Voted
RTS
2006
14 years 9 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...
101
Voted
DEXAW
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we present Energy Aware Random Asynchronous Wakeup (RAW-E), a novel crosslayer power management and routing protocol for heterogeneous wireless sensor and actor netw...