๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Greedy search and a hybrid local optimiz
โœ Raymond A. Wildman; Daniel S. Weile ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 191 KB

## 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

A New Efficient Algorithm for Embedding
โœ Volker Heun; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

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

Amer. inst. chem. eng. j.: Pho, T. K. an
๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 116 KB

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