6393 search results - page 360 / 1279 » Randomized Algorithms on the Mesh |
171
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 ...
242
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...
153
click to vote
IJCAI
1997
15 years 8 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...
162
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...
177
click to vote
CPC
2006
15 years 6 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...