𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The dynamic index-allocation problem

✍ Scribed by A. A. Alekseev

Publisher
Springer US
Year
1987
Tongue
English
Weight
390 KB
Volume
22
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Finite-size scaling approach to dynamic
Finite-size scaling approach to dynamic storage allocation problem
✍ Hamed Seyed-allaei πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 116 KB

It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of ΓΏnite-size scaling. The method is illustrated in the three simple cases of the ΓΏrst-ΓΏt, next-ΓΏt and best-ΓΏt algorithms, and the system works at full capacity. The analysis is done from two di erent points of vie

The selection allocation problem
The selection allocation problem
✍ Renato de Matta; Vernon Ning Hsu; Timothy J. Lowe πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit-maximizing (or cost-minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of