Search
Now showing items 31-40 of 4210
Automatic Planning of Manipulator Transfer Movements
(1980-12-01)
This paper deals with the class of problems that involve finding where to place or how to move a solid object in the presence of obstacles. The solution to this class of problems is essential to the automatic planning ...
Jokes and the Logic of the Cognitive Unconscious
(1980-11-01)
Freud's theory of jokes explains how they overcome the mental "censors" that make it hard for us to think "forbidden" thoughts. But his theory did not work so well for humorous nonsense as for other comical subjects. ...
Flavors: Message Passing in the Lisp Machine
(1980-11-01)
The object oriented programming style used in the Smalltalk and Actor languages is available in Lisp Machine Lisp, and used by the Lisp Machine software system. It is used to perform generic operations on objects. Part ...
The Curve of Least Energy
(1981-01-01)
Here we search for the curve which has the smallest integral of the square of curvature, while passing through two given points with given orientation. This is the true shape of a spline used in lofting. In computer-aided ...
Destructive Reordering of CDR-Coded Lists
(1980-08-01)
Linked list structures can be compactly represented by encoding the CDR ("next") pointer in a two-bit field and linearizing list structures as much as possible. This "CDR-coding" technique can save up to 50% on storage ...
Interim Report of the LOGO Project in the Brookline Public Schools
(1978-06-01)
The LOGO activities of a group of 16 sixth-grade students, representing a full spectrum of ability, are being documented with a view to developing ways of capturing the learning possibilities of such an environment. The ...
AMORD: A Deductive Procedure System
(1978-01-01)
We have implemented an interpreter for a rule-based system, AMORD, based on a non-chronological control structure and a system of automatically maintained data-dependencies. The purpose of this paper is to serve as a ...
A Hypothetical Monologue Illustrating the Knowledge Underlying Program Analysis
(1979-01-01)
Automated Program Analysis is the process of discovering decompositions of a system into sub-units such that the behavior of the whole program can be inferred from the behavior of its parts. Analysis can be employed ...
Towards a Theory of Local and Global in Computation
(1977-09-01)
We formulate the rudiments of a method for assessing the difficulty of dividing a computational problem into "independent simpler parts." This work illustrates measures of complexity which attempt to capture the ...
Propagation of Constraints Applied to Circuit Synthesis
(1978-09-01)
A major component in the process of design is synthesis, the determination of the parameters of the parts of a network given desiderata for the behavior of the network as a whole. Traditional automated synthesis ...