𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A graphical representation of the dynamic programming algorithm

✍ Scribed by L. Hellinckx; M. Rijckaert

Publisher
Elsevier Science
Year
1967
Tongue
English
Weight
208 KB
Volume
22
Category
Article
ISSN
0009-2509

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A paramorphic representation of the acce
A paramorphic representation of the acceptability of behavioral programming
✍ Scott Spreat; David Lipinski; Rick Dickerson; Robert Nass; Michael F. Dorsey πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 594 KB

Vignette methodology was used to assess factors associated with decisions regarding treatment acceptability. Three hundred and eleven professionals who worked with persons with mental retardation completed questionnaires on the restrictiveness of 12 procedures and on the acceptability of four unique