| Autor: |
Bar-Noy, Amotz, Bar-Yehuda, Reuven, Freund, Ari, Naor, Joseph, Schieber, Baruch |
| Předmět: |
|
| Zdroj: |
Journal of the ACM; Sep2001, Vol. 48 Issue 5, p1069, 21p, 1 Chart |
| Abstrakt: |
Presents a study that examined a general framework for solving resource allocation and scheduling problems. Algorithms that approximate the maximum throughput or the minimum loss by a constant factor; Computations on discrete structures; Information on dynamic storage allocation. |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
