Showing papers in "Information Sciences in 1968"

TL;DR: The cross-correlation function between two maximum-length linear shift register sequences of the same degree is shown to be computable as an explicit linear transformation, in matrix form, on either one of the sequences, regarded as a vector.

TL;DR: A theoretical basis for identifying stationary or slowly varying parameters by means of a gradient algorithm and it is shown that the Lyapunov-optimum gain matrix is also an error-correction gain matrix.

TL;DR: The basic result of this paper is that a weighted integral of the minimum variance smoothing estimate should be included in the optimal control of stochastic control.

TL;DR: A class of methods for deriving values for these parameters given a finite set of samples of each pattern class, those which use least-square or least-mean-square approximation to an unknown probability density or partially specified discriminant function are discussed.

TL;DR: Use of a decomposition technique called “stratification” enables us to overcome difficulties in the case of checkers and to treat King-Pawn endings in chess.

TL;DR: A new approach to converting the output observations on a process directly to control signals for the process is presented, based upon a single performance index which weights the deviations from the observational history along with a measure of the future cost of control.