3055 search results - page 186 / 611 » Randomized Search Trees |
112
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
113
click to vote
COMPGEOM
1998
ACM
15 years 5 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
101
Voted
AAAI
2007
15 years 3 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
103
Voted
FLAIRS
2007
15 years 3 months ago
2007
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
162
Voted
CATA
2009
15 years 1 months ago
2009
The nearest shrunken centroid classifier uses shrunken centroids as prototypes for each class and test samples are classified to belong to the class whose shrunken centroid is nea...