Sign In

Communications of the ACM

Table of Contents


New directions


Conversion of limited-entry decision tables to computer programs—a proposed modification to Pollack's algorithm

Pollack has proposed an algorithm for converting decision tables into flowcharts which minimize subsequent execution time when compiled into a computer program. Two modifications o this algorithm are proposed. The first relies …

A policy-driven scheduler for a time-sharing system

The services received by a process from a time-sharing operating system can be characterized by a resource count ∑ wiRij where Rij is the number of units of service received by process j from resource i and wi is the cost per …

An analysis of some time-sharing techniques

The effectiveness of certain time-sharing techniques such as program relocation, disk rotational delay minimization, and swap volume minimization is investigated. Summary data is presented, and the findings are discussed. The …

Experiments in automatic learning for a multipurpose hueristic program

An automatic learning capability has been developed and implemented for use with the MULTIPLE (MULTIpurpose Program that LEarns) heuristic tree-searching program, which is presently being applied to resolution theorem-proving …

On the probability distribution of the values of binary trees

An integral equation is derived for the generating function for binary tree values, the values reflecting sorting effort. The analysis does not assume uniformly distributed branching ratios, and therefore is applicable to a family …

Application of game tree searching techniques to sequential pattern recognition

A sequential pattern recognition (SPR) procedure does not test all the features of a pattern at once. Instead, it selects a feature to be tested. After receiving the result of that test, the procedure either classifies the unknown …

Complex interval arithmetic

Complex interval arithmetic is defined using real interval arithmetic. Complex interval division is defined so as to assure smallest possible resulting intervals.

Algorithm 405: roots of matrix pencils: the generalized eigenvalue problem [F2]

* This work was supported by the US National Aeronautics and Space Administration, by the National Science Foundation under Grant GS-2703 to the University of Chicago, and by the US Office of Naval Research under Grant NONR 760 …

ACM forum