5138 search results - page 197 / 1028 » Randomized Algorithms for 3-SAT |
222
click to vote
TAINN
2005
Springer
15 years 12 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
160
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
171
click to vote
WSCG
2004
15 years 7 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
184
click to vote
JMLR
2006
15 years 6 months ago
2006
Random forests were introduced as a machine learning tool in Breiman (2001) and have since proven to be very popular and powerful for high-dimensional regression and classificatio...
186
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...