2084 search results - page 188 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
133
Voted
MM
2004
ACM
15 years 8 months ago
2004
ACM
Carriers increasingly differentiate their wide-area connectivity offerings by means of customized services, such as virtual private networks (VPN) with Quality of Service (QoS) g...
109
Voted
SODA
2010
ACM
16 years 9 hour ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
119
Voted
SIGMETRICS
2008
ACM
15 years 2 months ago
2008
ACM
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
112
click to vote
ECCC
2010
15 years 2 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
116
Voted
SODA
2001
ACM
15 years 4 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...