301 search results - page 24 / 61 » On bounding the delay of a critical path |
103
click to vote
LCN
2008
IEEE
15 years 6 months ago
2008
IEEE
—We propose a scheme for routing and placement of mobile data collectors in Underwater Acoustic Sensor Networks (UASNs). The proposed scheme maximizes the lifetime of the network...
117
click to vote
TON
2008
14 years 11 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
ICPP
2003
IEEE
15 years 5 months ago
2003
IEEE
Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such...
ESTIMEDIA
2006
Springer
15 years 3 months ago
2006
Springer
Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present an approach that can be coupled to any adaptive routing algorithm ...
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a novel incremental placement methodology called FlowPlace for significantly reducing critical path delays of placed standard-cell circuits. FlowPlace includes: a) a t...