1274 search results - page 229 / 255 » N-fold integer programming |
117
click to vote
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
ISCA
1999
IEEE
15 years 4 months ago
1999
IEEE
Providing adequate data bandwidth is extremely important for a wide-issue superscalar processor to achieve its full performance potential. Adding a large number of ports to a data...
109
click to vote
DIALM
2007
ACM
15 years 3 months ago
2007
ACM
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
137
click to vote
CC
2008
Springer
15 years 1 months ago
2008
Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
120
click to vote
DLS
2005
15 years 1 months ago
2005
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...