Search
Now showing items 31-40 of 166
Sides 21
(1966-08-01)
SIDES 21 produces a graph consisting of the locations of lines which comprise the sides of either a geometric solid or a plane figure. The representation is in floating point mode, suitable for subsequent processing. The ...
Summer Vision Group: A Quick Look at Some of Our Programs
(1966-07-01)
no abstract
Additions to Vision Library
(1966-08-01)
Modified LAP: Additions have been made to LAP as described in the PDP-6 write-up.
SARGE: A Program for Drilling Students in Freshman Calculus Integration Problems
(1968-03-01)
The SARGE program is a prototype of a program which is intended to be used as an adjacent to regular classroom work in freshman calculus. Using SARGE, students can type their step-by-step solution to an indefinite ...
REEX: A CONVERT Program to Realize the McNaughton-Yamada Analysis Algorithm
(1968-01-01)
REEX is a CONVERT program, realized in the CTSS-LISP of Project Mac, for carrying out the McNaughton-Yamada analysis algorithm, whereby a regular expression is found describing the words accepted by a finite state machine ...
A Left to Right then Right to Left Parsing Algorithm
(1968-02-01)
Determination of the minimum resources required to parse a language generated by a given context free grammar is an intriguing and yet unsolved problem. It seems plausible that any unambiguous context free grammar could ...
Producing Memos, Using TJ6, TECO and the Type 37 Teletype
(1968-09-01)
This memo describes the TJ6 type justifying program, which can be used in the production of memos, such as this one. In addition, sections III and IV of this memo contain related information about TECO and the type ...
ITS 1.5 Reference Manual
(1969-07-01)
This reference manual consists of two parts. The first (sections 1 through 6) is intended for those who are either interested in the ITS 1.5 time sharing monitor for its own sake or who wish to write machine language ...
Numerical Solution of Elliptic Boundary Value Problems by Spline Functions
(1968-04-01)
A numerical method for solving linear, two-dimensional elliptic boundary value problems is presented. The method is essentially the Ritz procedure which uses; polynomial spline functions to approximate the exact solution. ...
Linear Decision and Learning Models
(1968-03-01)
This memorandum is a first draft of an essay on the simplest "learning" process. Comments are invited. Subsequent sections will treat, among other things: the "stimulus-sampling" model of Estes, relations between Perceptron-type ...