2252 search results - page 180 / 451 » Lower Bounds for Dynamic Algorithms |
116
Voted
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
137
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a uti...
133
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
128
Voted
ML
2002
ACM
15 years 3 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
123
Voted
ISPDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...