Advanced Search
DSpace@MIT

Browsing AI Memos (1959 - 2004) by Title

Research and Teaching Output of the MIT Community

Browsing AI Memos (1959 - 2004) by Title

Sort by: Order: Results:

  • Final Report of the Brookline LOGO Project. Part II: Project Summary and Data 
    Papert, Seymour; Watt, Daniel; diSessa, Andrea; Weir, Sylvia (1979-09-01)
    During the school year 1977/78 four computers equipped with LOGO and Turtle Graphics were installed in an elementary school in Brookline, Mass. All sixth grade students in the school had between 20 and 40 hours of ...
  • Finding Junctions Using the Image Gradient 
    Beymer, David J. (1991-12-01)
    Junctions are the intersection points of three or more intensity surfaces in an image. An analysis of zero crossings and the gradient near junctions demonstrates that gradient-based edge detection schemes fragment edges ...
  • Finding the Skeleton of a Brick 
    Finin, Tim (1973-03-01)
    TC-SKELETONs duty is to help find the dimensions of brick shaped objects by searching for sets of three complete edges, one for each dimension. The program was originally written by Patrick Winston, and then was refined ...
  • The Find-Path Problem in the Plane 
    Nguyen; Van-Duc (1984-02-01)
    This paper presents a fast heuristic algorithm for planning collision-free paths of a moving robot in a cluttered planar workspace. The algorithm is based on describing the free space between the obstacles as a network ...
  • The FINDSPACE Problem 
    Sussman, Gerald J. (1973-03-01)
    The FINDSPACE problem is that of establishing a volume in space where an object of specified dimensions will fit. The problem seems to have two subproblems: the hypothesis generation problem of finding a likely spot to ...
  • Fingerprints Theorems for Zero-Crossings 
    Yuille, A.L.; Poggio, T. (1983-10-01)
    We prove that the scale map of the zero-crossings of almost all signals filtered by the second derivative of a gaussian of variable size determines the signal uniquely, up to a constant scaling and a harmonic function. ...
  • Flavors: Message Passing in the Lisp Machine 
    Weinreb, Daniel; Moon, David (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 ...
  • FLIP - A Format List Processor 
    Teitelman, Warren (1967-07-01)
    This memo describes a notion of programming language for expressing, from within a LISP system, string manipulation such as those performed in COMIT. The COMIT formalism has been extended in several ways: the patterns (the ...
  • Floyd-Hoare Verifiers "Considered Harmful" 
    Shrobe, Howard E. (1978-01-01)
    The Floyd-Hoare methodology completely dominates the field of program verification and has contributed much to our understanding of how programs might be analyzed. Useful but limited verifiers have been developed using ...
  • Focusing 
    Horn, B.K.P. (1968-05-01)
    This memo describes a method of automatically focusing the new vidisector (TVC). The same method can be used for distance measuring. Included are instructions describing the use of a special LISP and the required LISP-functions. ...
  • Force Feedback in Precise Assembly Tasks 
    Inoue, Hirochika (1974-08-01)
    This paper describes the execution of precise assembly tasks by a robot. The level of performance of the experimental system allows such basic actions as putting a peg into a hole, screwing a nut on a bolt, and picking ...
  • Forecasting Global Temperature Variations by Neural Networks 
    Miyano, Takaya; Girosi, Federico (1994-08-01)
    Global temperature variations between 1861 and 1984 are forecast usingsregularization networks, multilayer perceptrons and linearsautoregression. The regularization network, optimized by stochasticsgradient descent associated ...
  • Formalizing Reusable Software Components in the Programmer's Apprentice 
    Rich, Charles; Waters, Richard C. (1987-02-01)
    There has been a long-standing desire in computer science for a way of collecting and using libraries of standard software components. The limited success in actually doing this stems not from any resistance to the ...
  • Formalizing Triggers: A Learning Model for Finite Spaces 
    Niyogi, Partha; Berwick, Robert C. (1993-11-01)
    In a recent seminal paper, Gibson and Wexler (1993) take important steps to formalizing the notion of language learning in a (finite) space whose grammars are characterized by a finite number of parameters. They introduce ...
  • Form and Content in Computer Science 
    Minsky, Marvin (1969-12-01)
    The trouble with computer science today is an obsessive concern with form instead of content. This essay has three parts, suggesting form-content displacements in Theory of Computation in Programming languages and in Education.
  • A Formulation for Active Learning with Applications to Object Detection 
    Sung, Kah Kay; Niyogi, Partha (1996-06-06)
    We discuss a formulation for active example selection for function learning problems. This formulation is obtained by adapting Fedorov's optimal experiment design to the learning problem. We specifically show how to ...
  • Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis 
    Stallman, Richard M.; Sussman, Gerald Jay (1976-09-01)
    We present a rule-based system for computer-aided circuit analysis. The set of rules, called EL, is written in a rule language called ARS. Rules are implemented by ARS as pattern-directed invocation demons monitoring ...
  • Frame-based Text Processing 
    Rosenberg, Steven T. (1977-11-01)
    This paper presents an overview of a theory of discourse structure, and discusses a model for assimilating text into a frame-based data structure. The model has been applied to the analysis of news articles. The theory ...
  • A Frame for Frames: Representing Knowledge for Recognition 
    Kuipers, Benjamin J. (1975-03-01)
    This paper presents a version of frames suitable for representing knowledge for a class of reconition problems. An initial section gives an intuitive model of frames, and illustrates a number of desirable features of ...
  • A Framework for Representing Knowledge 
    Minsky, Marvin (1974-06-01)
    This is a partial theory of thinking, combining a number of classical and modern concepts from psychology, linguistics, and AI. Whenever one encounters a new situation (or makes a substantial change in one's viewpoint) ...
MIT-Mirage