Search
Now showing items 11-20 of 1007
A Simple, Global, Complementary Variational Principle
(University of Wisconsin-Madison Department of Computer Sciences, 1969)
Deriving and Tabulating English Spelling-to-Sound Correspondences
(University of Wisconsin-Madison Department of Computer Sciences, 1968)
A series of programs has been written for deriving and tabulating English spelling-to-sound and sound-to-spelling correspondences. One program scans the spelling and pronunciation of a word and decides which sounds in the ...
Correctness of the Algol Procedure Askforhand
(University of Wisconsin-Madison Department of Computer Sciences, 1968)
Reasons are given to justify the writing of this particular proof of correctness. They include (i) illustration of some new techniques of proof, (ii) experimentation with a method of presenting a proof and (iii) presentation ...
Finite Difference Methods and the Eigenvalue Problem for Non Self-Adjoint Sturm-Liouville Operators
(University of Wisconsin-Madison Department of Computer Sciences, 1968)
A Memory Net Structure: Present Implementation and a Proposed Language
(University of Wisconsin-Madison Department of Computer Sciences, 1968)
A memory net structure has been designed which is particularly useful for storing, processing, and retrieving information of the type used in semantic analysis of natural language, question answering and theorem proving. ...
Flexible Pattern Recognition
(University of Wisconsin-Madison Department of Computer Sciences, 1969)
This paper presents and describes a sequence of three computer programs that examine what "flexibility" might mean in the context of pattern recognition. Flexibility is a vague, but important, concept, and it is something ...
Proofs of Algorithms for Asymptotic Series
(University of Wisconsin-Madison Department of Computer Sciences, 1969)
Six algorithms for computing asymptotic series as formulas are proved to be correct.
Convergence of the Conjugate Gradient Method: A Correction and a Different Approach
(University of Wisconsin-Madison Department of Computer Sciences, 1968)
Single Step Methods for the Solution of Singular Initial Value Problems
(University of Wisconsin-Madison Department of Computer Sciences, 1968)
Solution of Nonlinear Two-Point Boundary Value Problems by Linear Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1967)
A system of n nonlinear ordinary differential equations is considered on the interval [a, b] with at least one of the n boundary conditions specified at each end of the interval. In addition, any available a priori bounds ...