85 search results - page 8 / 17 » State-transition machines, revisited |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
CHARME
2003
Springer
14 years 26 days ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
ICCAD
2010
IEEE
13 years 5 months ago
2010
IEEE
Reducing circuit's peak current plays an important role in circuit reliability in deep sub-micron era. For sequential circuits, it is observed that the peak current has a str...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
In this paper, we consider the problem of calculating the signal and transition probabilities of the internal nodes of the combinational logic part of a nite state machine (FSM). ...