301 search results - page 16 / 61 » On bounding the delay of a critical path |
153
click to vote
INFOCOM
2007
IEEE
16 years 11 days ago
2007
IEEE
— This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm...
141
click to vote
ICC
2009
IEEE
16 years 24 days ago
2009
IEEE
—We consider data networks in which real-time/near real-time applications require not only successful transmission of packets from source to destination, but also specific end-to...
111
click to vote
ISCAS
2007
IEEE
16 years 10 days ago
2007
IEEE
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
161
click to vote
IBMRD
2006
15 years 6 months ago
2006
We present Justice, a set of extensions to the Liberty simulation infrastructure that model area, wire length, and power consumption in processor architectures. Given an architectu...
157
click to vote
GLVLSI
2008
IEEE
16 years 16 days ago
2008
IEEE
Timing optimizations during logic synthesis has become a necessary step to achieve timing closure in VLSI designs. This often involves “shortening” all paths found in the circ...