Sciweavers

184 search results - page 22 / 37
» Timing budgeting under arbitrary process variations
Sort
View
JMLR
2008
129views more  JMLR 2008»
14 years 10 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
TPDS
1998
92views more  TPDS 1998»
14 years 9 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
SAC
2006
ACM
15 years 3 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
DAC
2006
ACM
15 years 11 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...
MICRO
2003
IEEE
166views Hardware» more  MICRO 2003»
15 years 3 months ago
Razor: A Low-Power Pipeline Based on Circuit-Level Timing Speculation
With increasing clock frequencies and silicon integration, power aware computing has become a critical concern in the design of embedded processors and systems-on-chip. One of the...
Dan Ernst, Nam Sung Kim, Shidhartha Das, Sanjay Pa...