10718 search results - page 659 / 2144 » On the Circuit Implementation Problem |
181
click to vote
FAC
2002
15 years 7 months ago
2002
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. More...
220
click to vote
ESSLLI
2009
Springer
15 years 5 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
177
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...
216
click to vote
CAV
2009
Springer
16 years 8 months ago
2009
Springer
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
177
click to vote
ICFP
2006
ACM
16 years 7 months ago
2006
ACM
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...