This report describes the basic algorithm by which students are assigned to classes, the various criteria which directed the design of that algorithm, and the consequences of some of its features.

The University of Maryland Student Scheduling Program ...

In a paper published in last year's A.C.M. Proceedings a new method for estimating the population density, i.e., f, was described¹ The procedure was based upon the use of sample trigonometric moments as unbiased estimates of density f's Fourier ...

A technique for obtaining numerical approximations to Equation (1) will be briefly discussed. The convergence (under appropriate assumptions) of these approximations to a solution of Equation (1) has been shown elsewhere (see references ^1,4). The ...

This paper has presented a comparison of several channel-management algorithms for a variety of medium-speed data systems. It has pointed out (1) the various ways that the physical and electrical connections may be established, (2) the different channel ...

Consider an involved function f(x) which is to be approximated in the interval (α,β) by the rational function h (a, c, x):

[equation]

To determine h (a, c, x) we need to find the values of the unknown coefficients a_j and c_j. The minimax or Chebyshev ...

The problem under consideration here is to solve the system of linear equations Ax=b in the sense of Chebyshev. The matrix A is m × n with rank n and n+1≤ m. Define