160 search results - page 17 / 32 » Satisfiability-Based Algorithms for Boolean Optimization |
DAGSTUHL
2006
15 years 1 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
DAC
2000
ACM
16 years 19 days ago
2000
ACM
The proliferation of the Internet has a ected the business model of almost all semiconductor and VLSI CAD companies that rely on intellectual property (IP) as their main source of...
WABI
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
111
click to vote
ISLPED
2009
ACM
15 years 6 months ago
2009
ACM
Many techniques for power management employed in advanced RTL synthesis tools rely explicitly or implicitly on observability don’t-care (ODC) conditions. In this paper we presen...
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...