Advanced Search
DSpace@MIT

Browsing AI Working Papers (1971 - 1995) by Title

Research and Teaching Output of the MIT Community

Browsing AI Working Papers (1971 - 1995) by Title

Sort by: Order: Results:

  • Horn, Berthold K.P. (MIT Artificial Intelligence Laboratory, 1973-03-08)
    This paper presents a solution to the problem of determining the distribution of an absorbing substance inside a non-opaque non-scattering body from images or ray samplings. It simultaneously solves the problem of determining ...
  • Lee, Jintae (MIT Artificial Intelligence Laboratory, 1989-08)
    In this report, I describe a language, called Decision Representation Language (DRL), for representing the qualitative aspects of decision making processes such as the alternatives being evaluated, goals to satisfy, and ...
  • Zabih, Ramin (MIT Artificial Intelligence Laboratory, 1988-08)
    Non-deterministic LISP can be used to describe a search problem without specifying the method used to solve the problem. We show that SCHEMER, a non-deterministic dialect of SCHEME, can support dependency-directed backtracking ...
  • Gaschnig, John Gary (MIT Artificial Intelligence Laboratory, 1973-03-09)
    Some general properties of textures are discussed for a restricted class of textures. A program is described which inputs a scene using vidisector camera, discerns the texture elements, calculates values for a set of ...
  • Marroquin, J. L. (MIT Artificial Intelligence Laboratory, 1983-07)
    In this paper we analyse several approaches to the design of Cooperative Algorithms for solving a general problem: That of computing the values of some property over a spatial domain, when these values are constrained (but ...
  • Wills, Linda M. (MIT Artificial Intelligence Laboratory, 1989-06)
    Program recognition is a program understanding technique in which stereotypic computational structures are identified in a program. From this identification and the known relationships between the structures, a hierarchical ...
  • Torre, V.; Poggio, T. (MIT Artificial Intelligence Laboratory, 1983-03)
    We present several results characterizing two differential operators used for edge detection: the Laplacian and the second directional derivative along the gradient. In particular, (a)we give conditions for coincidence of ...
  • Blanchard, David C. (MIT Artificial Intelligence Laboratory, 1976-08)
    This paper describes a scheme for providing low-level control of a multi-link serial manipulator. The goal was to achieve adaptive behavior without making assumptions about the environment.
  • Rich, Charles; Waters, Richard C. (MIT Artificial Intelligence Laboratory, 1981-12)
    Simplifying assumptions — everyone uses them but no one's programming tool explicitly supports them. In programming, as in other kinds of engineering design, simplifying assumptions are an important method for dealing with ...
  • Rosenberg, Steven T. (MIT Artificial Intelligence Laboratory, 1976-08-17)
    An essential step in understanding connected discourse is the ability to link the meanings of successive sentences together. Given a growing database to which new sentence meanings must be linked, which out of many possible ...
  • Haase, Ken (MIT Artificial Intelligence Laboratory, 1987-03)
    The emergence in 1976 of Doug Lenat's mathematical discovery program AM [Len76] [Len82a] was met with suprise and controversy; AM's performance seemed to bring the dream of super-intelligent machines to our doorstep, with ...
  • Fahlman, Scott E. (MIT Artificial Intelligence Laboratory, 1973-09)
    This paper briefly discusses the following questions: What are the benefits of special-purpose languages? When is a field ready for such a language? Are any parts of our current vision research ready?
  • Amsterdam, Jonathan (MIT Artificial Intelligence Laboratory, 1990-05)
    I describe an iteration macro for Common Lisp that is clear, efficient, extensible, and in excellent taste.
  • Horn, Berthold K.P. (MIT Artificial Intelligence Laboratory, 1977-10)
    In order to be able to design a control system for high-speed control of mechanical manipulators, it is necessary to understand properly their dynamics. Here we present an analysis of a detailed model of a three-link device ...
  • Hillis, D. (MIT Artificial Intelligence Laboratory, 1983-01)
    We have developed an efficient Lagrangian formulation of manipulators with small numbers of degrees of freedom. The efficiency derives from the lack of velocities, accelerations, and generalized forces. The number of ...
  • Donald, Bruce R. (MIT Artificial Intelligence Laboratory, 1984-08)
    We describe a simple geometric modelling system called Eight which supports interactive creation, editing, and display of three-dimensional polyhedral solids. Perspective views of a polyhedral environment may be generated, ...
  • Zelinka, Linda M. (MIT Artificial Intelligence Laboratory, 1983-03)
    Large programs undergo many changes before they run in a satisfactory manner. For many large programs, modification histories are kept which record every change that is made to the program. By studying these records, ...
  • Hewitt, Carl (MIT Artificial Intelligence Laboratory, 1979-05)
  • Miller, Mark L. (MIT Artificial Intelligence Laboratory, 1975-01-16)
    A focus on planning and debugging procedures underlies the enhanced proficiency of recent programs which solve problems and acquire new skills. By describing complex procedures as constituents of evolutionary sequences of ...
  • Inman, Jeff (MIT Artificial Intelligence Laboratory, 1991-08-05)
    We re-examine the evolutionary stability of the tit-for-tat (tft) strategy in the context of the iterated prisoner's dilemma, as introduced by Axelrod and Hamilton. This environment involves a mixture of populations of ...
MIT-Mirage