Sciweavers

465 search results - page 60 / 93
» On the Hardness of Range Assignment Problems
Sort
View
IEEEPACT
2002
IEEE
15 years 6 months ago
A Framework for Parallelizing Load/Stores on Embedded Processors
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...
Xiaotong Zhuang, Santosh Pande, John S. Greenland ...
ICCAD
2003
IEEE
149views Hardware» more  ICCAD 2003»
15 years 11 months ago
Algorithm for Achieving Minimum Energy Consumption in CMOS Circuits Using Multiple Supply and Threshold Voltages at the Module L
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...
Yuvraj Singh Dhillon, Abdulkadir Utku Diril, Abhij...
ATAL
2007
Springer
15 years 8 months ago
Policy recognition for multi-player tactical scenarios
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...
Gita Sukthankar, Katia P. Sycara
DAC
2000
ACM
15 years 6 months ago
Model-based dummy feature placement for oxide chemical-mechanical polishing manufacturability
—Chemical–mechanical polishing (CMP) is an enabling technique used in deep-submicrometer VLSI manufacturing to achieve long range oxide planarization. Post-CMP oxide topography...
Ruiqi Tian, D. F. Wong, Robert Boone
CCGRID
2004
IEEE
15 years 5 months ago
Lambda scheduling algorithm for file transfers on high-speed optical circuits
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, ...
Hua Lee, Malathi Veeraraghavan, Hojun Li, Edwin K....