137 search results - page 8 / 28 » Heuristic Backtracking Algorithms for SAT |
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
CONSTRAINTS
2006
13 years 8 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
FLAIRS
2004
13 years 9 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...