736 search results - page 107 / 148 » Algorithms for Ordinal Arithmetic |
POPL
2010
ACM
14 years 6 months ago
2010
ACM
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
CADE
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
DIALM
2007
ACM
14 years 18 days ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
DAC
2007
ACM
14 years 9 months ago
2007
ACM
In the paper, we propose a new metric for the minimization of area in the generic problem of multiple constant multiplications, and demonstrate its effectiveness for digital FIR f...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...