Jean E. Sammet
Pages 665-666
When
Communications of the ACM began publication in 1959, the members of ACM's Editorial Board made the following remark as they described the purposes of ACM's periodicals [2]: “If computer programming is to become an important …
Donald E. Knuth
Pages 667-673
In this article the author urges a prudent and decentralized approach to the question of the design and desirability of computerized community information utilities. Before accepting the inevitability and desirability of this …
Laurence I. Press
Pages 674-678
The HASP Execution Task Monitor periodically rearranges the OS/360 dispatching chain to give tasks preemptive execution priority in inverse order to that of their cpu utilization history. The effect is to keep the I/O bound tasks …
J. C. Strauss
Pages 679-685
The problem of scheduling two or more processors to minimize the execution time of a program which consists of a set of partially ordered tasks is studied. Cases where task execution times are deterministic and others in which …
Thomas L. Adam, K. M. Chandy, J. R. Dickson
Pages 685-690
When the shape parameter,
&agr;, is integral, generating gamma random variables with a digital computer is straightforward. There is no simple method for generating gamma random variates with non-integral shape parameters. A common …
N. D. Wallace
Pages 691-695
The problem classically titled “The Examination Schedule Problem” takes various forms in the literature. Most of these formulations can be presented in the terminology of classical Network Theory. One such formulation is: Given …
A. Salazar, R. V. Oakford
Pages 696-698
An explicit, coupled, single-step method for the numerical solution of initial value problems for systems of ordinary differential equations is presented. The method was designed to be general purpose in nature but to be especially …
Sherwood C. Chu, Mones Berman
Pages 699-702
John Pomeranz
Pages 703-704
The algorithm calculates the exact cumulative distribution of the two-sided Kolmogorov-Smirnov statistic for samples with few observations. The general problem for which the formula is needed is to assess the probability that …
Richard P. Brent
Pages 704-706
Gerhard Tesch, Zdeněk Fencl
Page 706
C. Bron
Page 706
T. M. R. Ellis
Page 706
Heuristic procedures are presented which have been developed to perform inferences by generalizing from available information. The procedures make use of a similarity structure which is imposed on the data base using nonnumerical …
C. William Skinner
Pages 707-712
