310 search results - page 11 / 62 » Randomized Binary Search Trees |
ESA
2006
Springer
14 years 1 months ago
2006
Springer
STACS
1999
Springer
14 years 2 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
BIOADIT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...