𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for bounded generalized processing networks

✍ Scribed by J. David Fuller; B. Lan

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
854 KB
Volume
24
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Fast Algorithm for Grid Generation
A Fast Algorithm for Grid Generation
✍ Stephen A. Jordan; Malcolm L. Spaulding πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 556 KB
Fast Search Algorithms for VQ Codebook G
Fast Search Algorithms for VQ Codebook Generation
✍ Jim Z.C. Lai; C.C. Lue πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 230 KB

In this paper, we propose two fast codebook generation algo-book. Some alternative methods are also available [14]. rithms by making use of the information in the iterative process. The pairwise Nearest Neighbor (PNN) algorithm is a new Comparing to the conventional full search method (the LBG alter

A Reach and Bound algorithm for acyclic
A Reach and Bound algorithm for acyclic dynamic-programming networks
✍ Matthew D. Bailey; Robert L. Smith; Jeffrey M. Alden πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 111 KB

## Abstract Node pruning is a commonly used technique for solution acceleration in a dynamic‐programming network. In pruning, nodes are adaptively removed from the dynamic programming network when they are determined not to lie on an optimal path. We introduce an Ρ‐pruning condition that extends pr