2252 search results - page 374 / 451 » Lower Bounds for Dynamic Algorithms |
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
CNSM
2010
13 years 7 months ago
2010
Cloud systems require elastic resource allocation to minimize resource provisioning costs while meeting service level objectives (SLOs). In this paper, we present a novel PRedictiv...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
COOPIS
2003
IEEE
14 years 2 months ago
2003
IEEE
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...