Sciweavers

100 search results - page 1 / 20
» sat 2005
Sort
View
93
Voted
SAT
2005
Springer
98views Hardware» more  SAT 2005»
15 years 7 months ago
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable
We present an algorithm that decides the satisfiability of a
Magnus Wahlström
67
Voted
SAT
2005
Springer
93views Hardware» more  SAT 2005»
15 years 7 months ago
Resolution Tunnels for Improved SAT Solver Performance
Michal Kouril, John V. Franco
93
Voted
SAT
2005
Springer
91views Hardware» more  SAT 2005»
15 years 7 months ago
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability
Sakari Seitz, Mikko Alava, Pekka Orponen
SAT
2005
Springer
117views Hardware» more  SAT 2005»
15 years 7 months ago
A Branching Heuristics for Quantified Renamable Horn Formulas
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...