659 search results - page 99 / 132 » Dynamic Algorithms for Graph Spanners |
88
Voted
INFOCOM
1998
IEEE
15 years 2 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
63
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
EMSOFT
2010
Springer
14 years 8 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
112
click to vote
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
87
Voted
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...