9 search results - page 1 / 2 » The decimation process in random k-SAT |
79
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
118
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
120
Voted
SODA
1998
ACM
15 years 1 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
89
Voted
GRAPHICSINTERFACE
2003
15 years 1 months ago
2003
We present an out-of-core mesh decimation algorithm that is able to handle input and output meshes of arbitrary size. The algorithm reads the input from a data stream in a single ...
106
Voted
CORR
2006
Springer
15 years 14 days 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 ...