SCOPUS 정보 검색 플랫폼

Volumn 6, Issue 2, 1977, Pages 131-149

A general packing algorithm for multidimensional resource requirements

Author keywords

Algorithm; heuristic; memory allocation; packing; space utilization

Indexed keywords

EID: 0013055126 PISSN: 00917036 EISSN: 15737640 Source Type: Journal
DOI: 10.1007/BF00999302 Document Type: Article

Times cited : (41)

References (9)

1
- 0004239668
- MacDonald, London, American Elsevier, New York
- (1971) Optimum Packing and Depletion
- Brown, A.R.¹

2
- 84932347896
- S. K. Chang and D. T. Tang, “Processor Allocation in a Distributed Computer System,”Proceedings of the IEEE /NBS Symposium on Computer Communications: Trends and Applications (1975).

3
- 84932333909
- M. R. Garey, R. L. Graham, and J. D. Ullman, “Worst-case analysis of memory allocation algorithms,”Proceedings of the Fourth Annual ACM Symposium on the Theory of Computing (1972).

4
- 84932326278
- D. S. Johnson, “Fast allocation algorithms,”Thirteenth Annual IEEE Symposium on Switching and Automata Theory (1973), pp. 144–154.

5
- 0003622855
- Near-Optimal Bin Packing Algorithms
- MIT, Cambridge, Mass.
- (1973) Ph.D. Thesis
- Johnson, D.S.¹

6
- 84932319119
- IBM Thomas J. Watson Research Center, Yorktown Heights, N.Y.
- (1975) Multi-dimensional Bin Packing Algorithms
- Kou, L.T.¹ Markowsky, G.²

8
- 1842603084
- Princeton University, Princeton, N.J.
- (1971) The Performance of a Memory Allocation Algorithm
- Ullman, J.D.¹

9
- 84932368671
- IBM Research Center, Yorktown Heights, N.Y.
- (1974) Bin Packing Problem
- Yao, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.