1960 search results - page 243 / 392 » The Logic of Large Enough |
ISCA
2006
IEEE
14 years 4 months ago
2006
IEEE
We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and t...
ECAI
2004
Springer
14 years 3 months ago
2004
Springer
Learning general truths from the observation of simple domains and, further, learning how to use this knowledge are essential capabilities for any intelligent agent to understand ...
TACAS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
ASPDAC
2000
ACM
14 years 2 months ago
2000
ACM
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
DATE
1999
IEEE
14 years 2 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...