738 search results - page 15 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation task. Network congestions occur in these systems. Most applications rely on conge...
78
Voted
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
We examine the stereo correspondence problem in the presence of slanted scene surfaces. In particular, we highlight a previously overlooked geometric fact: a horizontally slanted ...
DAC
2008
ACM
16 years 22 days ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
JAIR
2011
14 years 6 months ago
2011
We introduce a novel logical notion–partial entailment–to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with...
JSC
2010
14 years 10 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...