1485 search results - page 161 / 297 » Whole Program Paths |
DAC
2006
ACM
14 years 10 months ago
2006
ACM
In this paper, we propose a new linear programming based timing driven placement framework for high performance designs. Our LP framework is mainly net-based, but it takes advanta...
ASPDAC
2009
ACM
14 years 3 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
RTSS
2005
IEEE
14 years 2 months ago
2005
IEEE
Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of code/data to scratchpad memory is performed at compile time leading to p...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...