711 search results - page 30 / 143 » Optimal placement by branch-and-price |
GLVLSI
2007
IEEE
13 years 8 months ago
2007
IEEE
Given a set of placed blocks, we present an algorithm that minimally spaces the blocks to ensure routability under several assumptions. By performing a binary search on total widt...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
—When manufacturing nano-devices, defects are a certainty and reliability becomes a critical issue. Until now, the most pervasive methods used to address reliability, involve inj...
PLDI
2005
ACM
14 years 1 months ago
2005
ACM
Code placement techniques have traditionally improved instruction fetch bandwidth by increasing instruction locality and decreasing the number of taken branches. However, traditio...
FPGA
2003
ACM
14 years 1 months ago
2003
ACM
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...