5138 search results - page 102 / 1028 » Randomized Algorithms for 3-SAT |
107
click to vote
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
87
Voted
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
Slope selection is a well-known algorithmic tool used in the context of computing robust estimators for fitting a line to a collection P of n points in the plane. We demonstrate th...
114
click to vote
ICCS
2001
Springer
15 years 6 months ago
2001
Springer
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomiz...
112
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
148
click to vote
CCECE
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...