168 search results - page 24 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
101
click to vote
COLT
1992
Springer
15 years 3 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
111
click to vote
HPDC
2010
IEEE
14 years 12 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
119
click to vote
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
118
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...