A subquadratic algorithm for constructing approximately optimal binary search trees
โ Scribed by Lawrence L Larmore
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 732 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract A genetic programmingโbased geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithmโbased techniques. Nonetheless, the genetic algorithms are still i
The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar
The SAR70 program has been written as a tool within the SAR design method for supports. A support is a building in which a variety of floorplans for dwellings can hc made. The design method allows evaluation of such asupport. SAR7O can be used to generate all variations possible within a support str