3495 search results - page 13 / 699 » On the random satisfiable process |
SIAMCOMP
1998
14 years 9 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
83
Voted
AAAI
2004
14 years 11 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
61
Voted
RSA
2006
14 years 9 months ago
2006
: Using the cavity equations of M
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— This paper is concerned with the robust stabilization of a class of stochastic large-scale systems. The uncertainties satisfy integral quadratic constraints. The random...