234 search results - page 2 / 47 » Randomized splay trees: Theoretical and experimental results |
79
Voted
PPSN
2004
Springer
15 years 2 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
76
Voted
ICTAI
1999
IEEE
15 years 1 months ago
1999
IEEE
This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillat...
82
Voted
STACS
1999
Springer
15 years 1 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 ...
84
Voted
SIGMOD
1999
ACM
15 years 1 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
82
Voted
ESA
2004
Springer
15 years 2 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...