A Review of the Packing Problem.

reportActive / Technical Report | Accession Number: ADA175007 | Open PDF

Abstract:

This random packing problem has been of interest to investigators in several disciplines. Physical chemists have investigated such models in two and three dimensions. Because of analytical difficulties, one-dimensional analogues have been explored and these are referred to as the parking problem. A number of results are explored and attempts are made to tie them together. Applications are also highlighted. Keywords Random packing, parking problem, Palasti conjecture.

Author(s):
Solomon, Herbert ; Weiner, Howard
Author Organization(s):
STANFORD UNIV CA DEPT OF STATISTICS
Descriptive Note:
Technical rept.,
Pagination:
0041

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TR-383
Contract/Grant Number(s):
N00014-86-K-0156
 Subject Terms
Joint Capability Areas:
JCA_5_Command and Control; JCA_5.3_Planning; JCA_2.4.1_Integration; JCA_2.4.2_Evaluation; JCA_1.2.7_Experimentation; JCA_2.4.5_Product Generation; JCA_2_Battlespace Awareness; JCA_2.4_Analysis Prediction and Production
Modernization Areas:
Cyber; Quantum Science and Computing
Communities of Interest:
Cyber
Descriptor(s):
*SEQUENTIAL ANALYSIS, *ASYMPTOTIC SERIES, *PACKING DENSITY, MATHEMATICAL MODELS, TWO DIMENSIONAL, RANDOM VARIABLES, ONE DIMENSIONAL, SPHERES, PACKAGING, NUMERICAL METHODS AND PROCEDURES, THEOREMS
Field(s)/Group(s):
Statistics and Probability
Keyword(s):
Random packing, Parking, Palasti conjecture, WUNR042267
Report Date:
1986 Nov 12