338 search results - page 52 / 68 » Fast distributed random walks |
107
click to vote
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
PVLDB
2010
14 years 8 months ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
MIDDLEWARE
2007
Springer
2007
Springer
AVMEM - Availability-Aware Overlays for Management Operations in Non-cooperative Distributed Systems
15 years 3 months ago
Monitoring and management operations that query nodes based on their availability can be extremely useful in a variety of largescale distributed systems containing hundreds to thou...
SASO
2010
IEEE
14 years 7 months ago
2010
IEEE
We present the ColoredPower algorithm, which is designed to provide collaborative electricity demand shaping for residential and small-business customers. Demand shaping for this m...
114
click to vote
AAAI
2006
14 years 11 months ago
2006
Intrusion attempts due to self-propagating code are becoming an increasingly urgent problem, in part due to the homogeneous makeup of the internet. Recent advances in anomalybased...