3495 search results - page 32 / 699 » On the random satisfiable process |
AAAI
1994
13 years 12 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
Random projection has been suggested as a means of dimensionality reduction, where the original data are projected onto a subspace using a random matrix. It represents a computati...
CAISE
2006
Springer
14 years 2 months ago
2006
Springer
Research on process flexibility has traditionally explored alternative ways of considering flexibility during the design of a business process. The focus typically has been on ways...
EJC
2008
13 years 10 months ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...