738 search results - page 13 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
113
click to vote
IEEESCC
2005
IEEE
15 years 5 months ago
2005
IEEE
The emerging paradigms of service oriented architectures and utility-based computing have the potential to greatly reduce the cost of data management. Data management service prov...
101
click to vote
CADE
2007
Springer
16 years 1 days ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
INDOCRYPT
2003
Springer
15 years 5 months ago
2003
Springer
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
125
click to vote
CAV
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
CVIU
2006
14 years 11 months ago
2006
In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant ...