151 search results - page 27 / 31 » Examples of Program Composition Illustrating the Use of Univ... |
WOSP
1998
ACM
13 years 11 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
PADL
2004
Springer
14 years 27 days ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
RP
2009
Springer
14 years 2 days ago
2009
Springer
Counterexamples for Non-disjunctive ions K. L. McMillan1 and L. D. Zuck2 1 Cadence Research Labs 2 University of Illinois at Chicago Counterexample-guided abstraction refinement (...
JMLR
2012
11 years 10 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...