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

An algorithmic and complexity analysis of interpolation search

โœ Scribed by Gaston H. Gonnet; Lawrence D. Rogers; J. Alan George

Publisher
Springer-Verlag
Year
1980
Tongue
English
Weight
558 KB
Volume
13
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Analysis and parameter selection for an
Analysis and parameter selection for an adaptive random search algorithm
โœ Rajeeva Kumar; Pierre T. Kabamba; David C. Hyland ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

This paper presents an analysis of an adaptive random search (ARS) algorithm, a global minimization method. A probability model is introduced to characterize the statistical properties of the number of iterations required to find an acceptable solution. Moreover, based on this probability model, a n

On the complexity of admissible search a
On the complexity of admissible search algorithms
โœ Alberto Martelli ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 788 KB

This paper analyzes the complexity of heuristic search algorithms, Le. algorithms which find the shortest path in a graph by using an estimate to guide the search. In particular, .algorithm A\*, due to Hart, Nilsson and Raphael, is shown to require 0(2 ~) steps, in the worst cdse, for searching a gr

An Improved VQ Codebook Search Algorithm
An Improved VQ Codebook Search Algorithm Using Principal Component Analysis
โœ Chin-Chen Chang; Dai-Chuan Lin; Tung-Shou Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 532 KB

process of VQ is achieved by using only the indices of the closest codewords for storage and transmission. ## We present an improved codebook search algorithm in this paper. We call it the double test of principal components As is obvious, choosing the closest codeword for each (DTPC). This algor