738 search results - page 47 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
ICCSA
2005
Springer
15 years 3 months ago
2005
Springer
Symmetries are not only fascinating, but they can also be exploited when designing numerical algorithms and data structures for scientific engineering problems in symmetrical doma...
142
click to vote
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
104
click to vote
RECOMB
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Recent genome sequencing studies have shown that the somatic mutations that drive cancer development are distributed across a large number of genes. This mutational heter...
DAC
1996
ACM
15 years 1 months ago
1996
ACM
Logic synthesis systems are complex systems and algorithmic research in synthesis has become highly specialized. This creates a gap where it is often not clear how an advance in a...
DSN
2003
IEEE
15 years 3 months ago
2003
IEEE
Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because...