2084 search results - page 152 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
124
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
121
Voted
IOR
2010
15 years 3 months ago
2010
We present exchange formulas that allow to express the stationary distribution of a continuous Markov chain with denumerable state-space having generator matrix Q∗ through a con...
150
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
150
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
175
click to vote
RTSS
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...