Jean E. Sammet
Page 309
The PL/I procedure CYCLE_GENERATOR is an implementation of Gibbs' algorithm [1] for finding all the cycles in a graph from a set of basic cycles.
Norman E. Gibbs
Page 310
The quality of computer generated images of three-dimensional scenes depends on the shading technique used to paint the objects on the cathode-ray tube screen. The shading algorithm itself depends in part on the method for modeling …
Bui Tuong Phong
Pages 311-317
Data set allocation in today's multilevel storage systems is usually based on qualitative, ad hoc decisions. While it would be desirable to obtain an optimal solution to this allocation problem, it is clear that the number of …
V. Y. Lum, M. E. Senko, C. P. Wang, H. Ling
Pages 318-322
This paper compares a new method of simulation organization, called the significant event method, with an old one, called the clock pulse method, using as examples two automobile traffic models. The significant event method is …
Alan F. Babich, John Grason, David L. Parnas
Pages 323-329
An efficient arrangement for interpretive code is described. It is related to Bell's notion of threaded code but requires less space and is more amenable to machine independent implementations.
Robert B. K. Dewar
Pages 330-331
A simplified recombination scheme for the Fibonacci buddy system which requires neither tables nor repetitive calculations and uses only two additional bits per buffer is presented.
Ben Cranston, Rick Thomas
Pages 331-332
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords …
Alfred V. Aho, Margaret J. Corasick
Pages 333-340
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linear space.
D. S. Hirschberg
Pages 341-343
hnique; using it, one may add and subtract numbers represented in any radix, including a mixed radix, and stored one digit per byte in bytes of sufficient size. Radix conversion is unnecessary, no looping is required, and numbers …
Stephen Soule
Pages 344-346
L. H. Harper, T. H. Payne, J. E. Savage, E. Straus
Pages 347-349
Simulation models of large, complex “real-world” applications have occasionally earned the reputation of eating up hours of computer time. This problem may be attributed in part to difficulties such as slow stochastic convergence …
F. Paul Wyman
Pages 350-353
Robert L. Ashenhurst
Pages 358-362
