Peter J. Denning
Pages 793-794
A general method for using disk files (instead of a more conventional parameter-passing mechanism) to transfer control information from a user interface to a set of related applications programs is described. This technique effectively …
Leonard J. Bass, Ralph E. Bunker
Pages 796-800
New analytical and empirical results for the performance of future event set algorithms in discrete event simulation are presented. These results provide a clear insight to the factors affecting algorithm performance, permit
…
William M. McCormack, Robert G. Sargent
Pages 801-812
The combinatorial complexity of most floor plan design problems makes it practically impossible to obtain a systematic knowledge of possible solutions using pencil and paper. The objective of this paper is to contribute to the …
Per Galle
Pages 813-825
The traditional mechanism for maintaining a list of pending events in a discrete event simulation is the simple linked list. However, in large scale simulations this list often becomes cumbersome to maintain since the number
…
John H. Blackstone, Gary L. Hogg, Don T. Phillips
Pages 825-829
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of
…
G. Jaeschke
Pages 829-833
Pages 851-853
