301 search results - page 26 / 61 » On bounding the delay of a critical path |
IFM
2009
Springer
15 years 6 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
107
click to vote
LCN
2008
IEEE
15 years 6 months ago
2008
IEEE
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...
113
click to vote
TKDE
2011
14 years 6 months ago
2011
—It is essential to process real-time data service requests such as stock quotes and trade transactions in a timely manner using fresh data, which represent the current real worl...
120
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Body sensor networks (BSNs) have been developed for a set of performance-critical applications, including smart healthcare, assisted living, emergency response, athletic perform...
100
click to vote
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...