Sciweavers

428 search results - page 22 / 86
» FPGA-Based SAT Solver
Sort
View
DATE
2002
IEEE
113views Hardware» more  DATE 2002»
14 years 20 days ago
BerkMin: A Fast and Robust Sat-Solver
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
Evguenii I. Goldberg, Yakov Novikov
DAC
2002
ACM
14 years 8 months ago
Can BDDs compete with SAT solvers on bounded model checking?
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
DATE
2005
IEEE
115views Hardware» more  DATE 2005»
14 years 1 months ago
An Efficient Sequential SAT Solver With Improved Search Strategies
Feng Lu, Madhu K. Iyer, Ganapathy Parthasarathy, L...
PRDC
2002
IEEE
14 years 18 days ago
Detecting Feature Interactions in Telecommunication Services with a SAT Solver
Feature interaction is a kind of inconsistent conflict between multiple communication services and considered an obstacle to developing reliable telephony systems. In this paper ...
Tatsuhiro Tsuchiya, Masahide Nakamura, Tohru Kikun...
FPL
2001
Springer
78views Hardware» more  FPL 2001»
14 years 5 days ago
Run-Time Performance Optimization of an FPGA-Based Deduction Engine for SAT Solvers
Andreas Dandalis, Viktor K. Prasanna, Bharani Thir...