738 search results - page 142 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
107
click to vote
CODASPY
2011
14 years 1 months ago
2011
—Progress in mobile wireless technology has resulted in the increased use of mobile devices to store and manage users’ personal schedules. Users also access popular contextbase...
100
click to vote
CSREAESA
2003
14 years 11 months ago
2003
Most so-called “adiabatic” digital logic circuit families reported in the low-power design literature are actually not truly adiabatic, in that they do not satisfy the general...
103
click to vote
SIAMCOMP
2002
14 years 9 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
107
click to vote
EON
2008
14 years 11 months ago
2008
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
CRYPTO
2011
Springer
13 years 9 months ago
2011
Springer
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...