1805 search results - page 18 / 361 » A Theory of Closure Operators |
128
click to vote
ICCAD
2001
IEEE
16 years 22 days ago
2001
IEEE
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...
106
click to vote
ENTCS
1998
15 years 3 months ago
1998
We present two ways to de ne covarieties and complete covarieties, i.e. covarieties that are closed under total bisimulation: by closure operators and by subcoalgebras of coalgebr...
135
click to vote
CDC
2010
IEEE
14 years 11 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...
176
click to vote
ICFP
2001
ACM
16 years 3 months ago
2001
ACM
The CIL compiler for core Standard ML compiles whole ML programs using a novel typed intermediate language that supports the generation of type-safe customized data representation...
132
click to vote
JCSS
2000
15 years 3 months ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...