77 search results - page 5 / 16 » Optimal leaf ordering of complete binary trees |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
KBS
2002
13 years 7 months ago
2002
In this paper, a hybrid learning approach named HDT is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to d...
AAAI
1996
13 years 8 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
IUI
2009
ACM
14 years 4 months ago
2009
ACM
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...