Finite stochastic automata with variable transition probabilities J. J. Paredaens OriginalPaper Pages: 1 - 20
Computing fourier integrals by means of near-optimal quadrature rules of the Lagrangian type S. -Å. GustafsonIngrid Melinder OriginalPaper Pages: 21 - 26
Note on minimizing the bandwidth of sparse, symmetric matrices K. Y. Cheng OriginalPaper Pages: 27 - 30
A desirable form for sparse matrices when computing their inverse in factored forms R. P. TewarsonK. Y. Cheng OriginalPaper Pages: 31 - 38
Der Out-Of-Kilter-Algorithmus für Antisymmetrische Netzwerke G. Tinhofer OriginalPaper Pages: 45 - 50
A computerized matchmaker that is capable of learning N. V. FindlerE. Goit OriginalPaper Pages: 69 - 72
Generation, recognition and parsing of context-free languages by means of recursive graphs F. P. Kaminger OriginalPaper Pages: 87 - 96