Sciweavers

2370 search results - page 188 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
101
Voted
DATE
2002
IEEE
75views Hardware» more  DATE 2002»
15 years 8 months ago
System Design for Flexibility
With the term flexibility, we introduce a new design dimension of an embedded system that quantitatively characterizes its feasibility in implementing not only one, but possibly ...
Christian Haubelt, Jürgen Teich, Kai Richter,...
DATE
2002
IEEE
102views Hardware» more  DATE 2002»
15 years 8 months ago
Library Compatible Ceff for Gate-Level Timing
Accurate gate-level static timing analysis in the presence of RC loads has become an important problem for modern deep-submicron designs. Non-capacitive loads are usually analyzed...
Bernard N. Sheehan
ECRTS
2002
IEEE
15 years 8 months ago
Robustness results concerning EDF scheduling upon uniform multiprocessors
—Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s fo...
Sanjoy K. Baruah
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
15 years 8 months ago
Computation of safety control for uncertain piecewise continuous systems on a partial order
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
Michael R. Hafner, Domitilla Del Vecchio
ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
15 years 8 months ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang