1960 search results - page 38 / 392 » The Logic of Large Enough |
PDPTA
2003
13 years 9 months ago
2003
Common binary arithmetic operations such as addition/subtraction and multiplication suffer from O(n) carry propagation delay where n is the number of digits. Carry lookahead helps...
COLING
2010
13 years 2 months ago
2010
Prepositions in English are a well-known challenge for language learners, and the computational analysis of preposition usage has attracted significant attention. Such research ge...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
For extremely Low-power Logic, three very new and promising techniques will be described. The first are methods on circuit and system level for reduced supply voltages. In large l...
AIML
2008
13 years 9 months ago
2008
We generalise some results of [7, 5] and show that if L is an -modal logic (for some ordinal 3) such that (i) L contains the product logic K and (ii) the product of -many trees o...
PLDI
2003
ACM
14 years 29 days ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...