159 search results - page 13 / 32 » On the Complexity of SAT |
IEEECIT
2010
IEEE
14 years 8 months ago
2010
IEEE
- The increase of embedded applications complexity has demanded hardware more flexible while providing higher performance. Reconfigurable architectures and stream processing have b...
CHARME
2003
Springer
15 years 2 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
124
click to vote
CPAIOR
2010
Springer
14 years 7 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
CP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
62
Voted
ASPDAC
2006
ACM
15 years 3 months ago
2006
ACM
Commonly used pattern sources in simulation-based verification include random, guided random, or design verification patterns. Although these patterns may help bring the design ...