192 search results - page 5 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
110
Voted
ICDE
2012
IEEE
12 years 12 months ago
2012
IEEE
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
ICCAD
2005
IEEE
15 years 6 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
115
click to vote
TACAS
2012
Springer
13 years 5 months ago
2012
Springer
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...