428 search results - page 73 / 86 » FPGA-Based SAT Solver |
ICCAD
2005
IEEE
14 years 4 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...
FMCAD
2007
Springer
13 years 11 months ago
2007
Springer
Parameterized heuristics abound in computer aided design and verification, and manual tuning of the respective parameters is difficult and time-consuming. Very recent results from ...
CP
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
NIPS
2008
13 years 9 months ago
2008
We present an algorithm for solving a broad class of online resource allocation . Our online algorithm can be applied in environments where abstract jobs arrive one at a time, and...
ICST
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability across their features. This leads to combinatorial explosion of the n...