3495 search results - page 4 / 699 » On the random satisfiable process |
100
Voted
AI
2007
Springer
15 years 3 months ago
2007
Springer
DAM
2007
15 years 3 months ago
2007
99
Voted
WSC
2001
15 years 4 months ago
2001
This paper discusses the validity of using common random numbers (CRNs) with two-stage selection procedures to improve the possibility of correct selection and discusses the intri...
151
Voted
FOCS
1999
IEEE
15 years 7 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...
133
Voted
AAAI
2008
15 years 5 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...