Sciweavers

1008 search results - page 15 / 202
» Minimizing Average Flow-Time
Sort
View
DAC
2005
ACM
13 years 10 months ago
Multi-frequency wrapper design and optimization for embedded cores under average power constraints
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
Qiang Xu, Nicola Nicolici, Krishnendu Chakrabarty
IOR
2008
89views more  IOR 2008»
13 years 8 months ago
Impulse Control of Brownian Motion: The Constrained Average Cost Case
When a manufacturer places repeated orders with a supplier to meet changing production requirements, he faces the challenge of finding the right balance between holding costs and ...
Melda Ormeci, J. G. Dai, John H. Vande Vate
TAMC
2007
Springer
14 years 2 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
ISLPED
1996
ACM
91views Hardware» more  ISLPED 1996»
14 years 22 days ago
Energy minimization using multiple supply voltages
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
Jui-Ming Chang, Massoud Pedram
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 9 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe