Sciweavers

5138 search results - page 178 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 7 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
FOCS
2000
IEEE
15 years 10 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
BERTINORO
2005
Springer
15 years 12 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
AIMSA
2008
Springer
16 years 23 days ago
Incorporating Learning in Grid-Based Randomized SAT Solving
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 6 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel