Sciweavers

Share
AAAI
1997

Summarizing CSP Hardness with Continuous Probability Distributions

11 years 2 months ago
Summarizing CSP Hardness with Continuous Probability Distributions
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 approximated by two standard families of continuous probability distribution functions. Solvable problems can be modelled by the Weibull distribution, and unsolvable problems by the lognormal distribution. These distributions t equally well over a variety of backtracking based algorithms.
Daniel Frost, Irina Rish, Lluís Vila
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 1997
Where AAAI
Authors Daniel Frost, Irina Rish, Lluís Vila
Comments (0)
books