AAAI
1997
14 years 1 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
CP
2004
Springer
14 years 5 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
CP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...