173 search results - page 25 / 35 » The Fastest and Shortest Algorithm for All Well-Defined Prob... |
137
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
168
click to vote
PODC
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
114
click to vote
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
162
click to vote
CIKM
2007
Springer
15 years 7 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
139
click to vote
DATE
2006
IEEE
15 years 7 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...