29 search results - page 3 / 6 » Smoothed Analysis of Binary Search Trees |
CAIP
2009
Springer
13 years 8 months ago
2009
Springer
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Like Darwinian-type genetic algorithms, there also exists genetic drift in Univariate Marginal Distribution Algorithm (UMDA). Since the universal analysis of genetic drift in UMDA...
DAC
2003
ACM
14 years 5 months ago
2003
ACM
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
PPSC
2001
13 years 6 months ago
2001
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...