Bernard A. Galler
Page 300
Two languages enabling their users to estimate the efficiency of computer programs are presented. The program whose efficiency one wishes to estimate is written in the first language, a go-to-less programming language which includes …
Jacques Cohen, Carl Zuckerman
Pages 301-308
Because of the large number of strategies and inference rules presently under consideration in automated theorem proving, there is a need for developing a language especially oriented toward automated theorem proving. This paper …
L. Henschen, Ross Overbeck, L. Wos
Pages 308-314
The paper describes a technique for compacting character sets in a digital computer while retaining fast access to individual bits. It considers the problem of minimizing the storage needed to contain such tables. Reduction techniques …
James F. Gimpel
Pages 315-318
I. Barroda, F. D. K. Roberts
Pages 319-320
R. L. Page
Pages 321-323
Robert Piessens
Page 324
Blaine Gaither
Page 324
T. M. R. Ellis
Pages 324-325
R. L. Page
Page 325
Several hundred college and university computer installations now offer various types of statistical packages for general use. Among those most widely available are OSIRIS, SPSS, BMD, DATA-TEXT, and TSAR. In order to provide
…
William D. Slysz
Pages 326-332
Methods for the compact representation of contour plots are described and tested. These are intended to reduce the cost of transmitting contour plots over phone lines. We feel some of these methods could be used to transmit contour …
John Adams, John Gary
Pages 333-336
This paper describes the design philosophy of HYDRA—the kernel of an operating system for C.mmp, the Carnegie-Mellon Multi-Mini-Processor. This philosophy is realized through the introduction of a generalized notion of “resource …
W. Wulf, E. Cohen, W. Corwin, A. Jones, R. Levin, C. Pierson, F. Pollack
Pages 337-345
Using direct access computer files of bibliographic information, an attempt is made to overcome one of the problems often associated with information retrieval, namely, the maintenance and use of large dictionaries, the greater …
Ian J. Barton, Susan E. Creasey, Michael F. Lynch, Michael J. Snell
Pages 345-350
Two algorithms are presented that construct the
k shortest paths between every pair of vertices in a directed graph. These algorithms generalize the Floyd algorithm and the Dantzig algorithm for finding the shortest path between …
Edward Minieka
Pages 351-353
Robert L. Ashenhurst
Page 354
Robert Piessens
Page 324
D. M. Boulton
Page 326
