Jean E. Sammet
Page 250
A bounded workspace copying algorithm for arbitrary list structures is given. This algorithm operates in linear time and does not require tag bits. The best previous bounded workspace copying algorithms achieved
n2 time without …
David A. Fisher
Pages 251-252
The need to envision and architecture data base systems in a hierarchical level by level framework is stressed. The inverted data base (file) organization is then analyzed, considering implementation oriented aspects. The inverted …
Alfonso F. Cárdenas
Pages 253-263
The paper describes a working analysis and generation program for natural language, which handles paragraph length input. Its core is a system of preferential choice between deep semantic patterns, based on what we call “semantic …
Yorick Wilks
Pages 264-274
The PL/I procedure BASIC_GENERATOR is an implementation of Paton's algorithm [1] for finding a set of basic (fundamental) cycles of a finite undirected graph from its vertex adjacency matrix.
Norman E. Gibbs
Pages 275-276
Robert Piessens, Irene Mertens
Page 276
R. G. Mashburn
Pages 276-277
C. J. Doran
Page 277
Fred N. Fritsch, Alan C. Hindmarsh
Page 277
D. J. Evans
Pages 278-279
Anthony I. Wasserman
Pages 279-280
In a recent paper [4], Minieka proposes an algorithm for finding kth shortest paths between all pairs of nodes in an N node network. His claimed time is O(k2N3).
B. L. Fox
Page 279
Peaks in a digitized waveform are detected by an algorithm incorporating piecewise linear approximation and tabular parsing techniques. Several parameters serve to identify the waveform context enabling accurate measurement of …
Steven L. Horowitz
Pages 281-285
The Designer Problem Solver (DPS) demonstrates that the computer can perform simple design tasks. In particular, it designs furniture and equipment layouts. This task was chosen because it is simple, well defined, and characteristic …
Charles E. Pfefferkorn
Pages 286-297
Pages 300-305
