708 search results - page 3 / 142 » Timing closure: the solution and its problems |
106
click to vote
ICSE
1993
IEEE-ACM
15 years 1 months ago
1993
IEEE-ACM
We give examples of situations where formal specifications of procedures in the standard pre/postcondition style become lengthy, cumbersome and difficult to change, a problem whic...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
AIPS
1994
14 years 11 months ago
1994
Aimsof traditional planners had beenlimited to finding a sequenceof operators rather than finding an optimal or neax-optimalfinal state. Consequent]y, the performanceimprovementsy...