September 1973 - Vol. 16 No. 9
Features
Computational algorithms for closed queueing networks with exponential servers
Methods are presented for computing the equilibrium distribution of customers in closed queueing networks with exponential servers. Expressions for various marginal…
Information theory applied to the conversion of decision tables to computer programs
Using ideas from information theory, this paper develops a heuristic algorithm that converts a limited entry decision table to a tree structured computer program with…
Evaluation and selection of file organization—a model and system
This work first discusses the factors that affect file (data base) organization performance, an elusive subject, and then presents a methodology, a model and a programmed…
Design of tree structures for efficient querying
A standard information retrieval operation is to determine which records in a data collection satisfy a given query expressed in terms of data values. The process of…
Empirical working set behavior
The working set model for program behavior has been proposed in recent years as a basis for the design of scheduling and paging algorithms. Although the words…
A simple technique for structured variable lookup
A simple technique for the symbol-table lookup of structured variables based on simple automata theory is presented. The technique offers a deterministic solution to a…
The ability to backtrack, or retrace, the execution of a computer program has gained wider acceptance recently as a desired feature within a programming language. This is…
Sard kernels for certain bivariate cubatures
An error analysis for some bivariate cubatures is given. The remainders are obtained by the use of Sard kernels. Numerical results and computer graphs are given for some…