523 search results - page 33 / 105 » On the Signal Bounding Problem in Timing Analysis |
GECCO
2000
Springer
15 years 5 months ago
2000
Springer
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
151
click to vote
FCCM
1999
IEEE
15 years 5 months ago
1999
IEEE
Abstract We are developing an integrated algorithm analysis and mapping environment particularly tailored for signal processing applications on Adaptive Computing Systems ACS. Our ...
121
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
ASPDAC
2010
ACM
14 years 11 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
117
click to vote
COCOON
2001
Springer
15 years 5 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...