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:

  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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.
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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) ...
  • Fong, Sandiway (1989-12-01)
    In the principles-and-parameters model of language, the principle known as "free indexation'' plays an important part in determining the referential properties of elements such as anaphors and pronominals. This paper ...
  • Roberts, R. Bruce; Goldstein, Ira P. (1977-09-01)
    The Frame Representation Language (FRL) is described. FRL is an adjunct to LISP which implements several representation techniques suggested by Minsky's [75] concept of a frame: defaults, constraints, inheritance, procedural ...
  • Roberts, R. Bruce; Goldstein, Ira P. (1977-07-01)
    The Frame Representation Language (FRL) is an experimental language written to explore the use of frames as a knowledge representation technique. The term 'frame' as used in FRL was inspired by Minsky's [75] development ...
  • Pontil, Massimiliano; Rifkin, Ryan; Evgeniou, Theodoros (1998-11-01)
    We study the relation between support vector machines (SVMs) for regression (SVMR) and SVM for classification (SVMC). We show that for a given SVMC solution there exists a SVMR solution which is equivalent for a certain ...
  • Marr, D.; Poggio, T. (1976-05-01)
    The CNS needs to be understood at four nearly independent levels of description: (1) that at which the nature of computation is expressed; (2) that at which the algorithms that implement a computation are characterized; ...
  • Hall, Robert J. (1987-05-01)
    This paper shows that, provided circuits contain no zero-delay loops, a tight relationship, full abstraction, exists between a natural event-based operational semantics for circuits and a natural denotational semantics ...
  • Lathrop, Richard H.; Robert J. Hall,; Kirk, Robert S. (1987-05-01)
    High-level functional (or behavioral) simulation models are difficult, time-consuming, and expensive to develop. We report on a method for automatically generating the program code for a high-level functional simulation ...
  • Hewitt, Carl (1968-01-01)
    Presented here is part of the graduate work that I am doing in the much broader area of protocol analysis (see A.I. memo 137). The goal of the function abstraction is to find a procedure that satisfies a given set of ...
  • Moses, Joel (1970-06-01)
    A problem common to many powerful programming languages arises when one has to determine what values to assign to free variables in functions. Different implementational approaches which attempt to solve the problem are ...
  • Fukumori, Koji (1980-09-01)
    Traditionally, the compilation of long-term timetables for high-density rail service with multiple classes of trains on the same track is a job for expert people, not computers. We propose an algorithm that uses the ...
MIT-Mirage