𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel blocking flow algorithm for acyclic networks

✍ Scribed by Uzi Vishkin

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
765 KB
Volume
13
Category
Article
ISSN
0196-6774

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 parallel load flow algorithm
A parallel load flow algorithm
✍ A.A. El-Keib; H. Ding; D. Maratukulam πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 415 KB