3495 search results - page 27 / 699 » On the random satisfiable process |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
WAIM
2004
Springer
14 years 4 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
JSAT
2008
13 years 10 months ago
2008
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
COCO
2008
Springer
14 years 13 days ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...