2252 search results - page 374 / 451 » Lower Bounds for Dynamic Algorithms |
115
Voted
CDC
2008
IEEE
15 years 9 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...
125
Voted
CNSM
2010
15 years 20 days 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...
145
Voted
PODC
2009
ACM
16 years 3 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...
124
Voted
COOPIS
2003
IEEE
15 years 8 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 ...
118
Voted
APPROX
2009
Springer
15 years 9 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...