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

A fast search algorithm on modified S-trees

โœ Scribed by Kuo-Liang Chung; Chih-Jen Wu

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
354 KB
Volume
16
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast Vector Quantization Encoding Based
Fast Vector Quantization Encoding Based onK-d Tree Backtracking Search Algorithm
โœ V. Ramasubramanian; K.K. Paliwal ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 404 KB

In this paper we consider the K-d tree-based backtracking search algorithm and study its performance in the context of vector quantization encoding of speech waveform. We discuss the basic algorithm in detail and highlight the features of optimization as observed from theoretical analysis and from t

A comparison of minimax tree search algo
A comparison of minimax tree search algorithms
โœ Murray S. Campbell; T.A. Marsland ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 849 KB

Although theoretic performance measures of most game-searching algorithms exist, for various reasons their practicality is limited. This paper examines and extends the existing search methods, and reports on empirical performance studies on trees with useful size and ordering properties. Emphasis is

A heuristic search algorithm with modifi
A heuristic search algorithm with modifiable estimate
โœ Lรกszlรณ Mรฉrรต ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 646 KB

## This paper describes an improved version of two previously published algorithms in the area: A\* and B. The new approach is based on considering the estimate fz(n ) on node n as a variable rather than as a constant. The new algorithm thus improves the estimate as it goes on, avoiding some usele