An optimal algorithm for generating minimal perfect hash functions
โ Scribed by Zbigniew J. Czech; George Havas; Bohdan S. Majewski
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 645 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A systolic algorithm is described for generating all permutations of \(n\) elements in lexicographic order. The algorithm is designed to be executed on a linear array of \(n\) processors, each having constant size memory, and each being responsible for producing one element of a given permutation. T
An exact penalty function type method, which avoids the necessity of solving a sequence of unconstrained problems, solves general constrained parameter minimization problems, and it may be applied to control system computer-aided design problems.