5138 search results - page 206 / 1028 » Randomized Algorithms for 3-SAT |
182
click to vote
CSCLP
2005
Springer
16 years 9 min ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
168
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
233
click to vote
FPGA
2008
ACM
15 years 8 months ago
2008
ACM
Stochastic simulations and other scientific applications that depend on random numbers are increasingly implemented in a parallelized manner in programmable logic. High-quality ps...
151
click to vote
IJCAI
1997
15 years 7 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...