2084 search results - page 269 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
133
click to vote
TON
2010
15 years 25 days ago
2010
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
149
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
136
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
169
click to vote
UAI
2008
15 years 3 months ago
2008
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
131
click to vote
FUIN
2008
15 years 2 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...