465 search results - page 60 / 93 » On the Hardness of Range Assignment Problems |
132
click to vote
IEEEPACT
2002
IEEE
15 years 4 months ago
2002
IEEE
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper proposes an optimum methodology for assigning supply and threshold voltages to modules in a CMOS circuit such that the overall energy consumption is minimized for a giv...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper addresses the problem of recognizing policies given logs of battle scenarios from multi-player games. The ability to identify individual and team policies from observat...
DAC
2000
ACM
15 years 4 months ago
2000
ACM
—Chemical–mechanical polishing (CMP) is an enabling technique used in deep-submicrometer VLSI manufacturing to achieve long range oxide planarization. Post-CMP oxide topography...
CCGRID
2004
IEEE
15 years 3 months ago
2004
IEEE
1 Scheduling resources on Grids is a well-known problem. The extension of Grids to LambdaGrids requires scheduling of lambdas, i.e., end-to-end high-speed circuits. In this paper, ...