1220 search results - page 119 / 244 » Minimal Interval Completions |
ICCAD
1997
IEEE
14 years 1 months ago
1997
IEEE
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
ICLP
1997
Springer
14 years 1 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
ESOP
2006
Springer
14 years 24 days ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
IPCO
1998
13 years 10 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
COMGEO
2010
ACM
13 years 9 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...