Advanced Search
DSpace@MIT

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Research and Teaching Output of the MIT Community

Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Sort by: Order: Results:

  • Symbolic Error Analysis and Robot Planning 
    Brooks, Rodney A. (1982-09-01)
    A program to control a robot manipulator for industrial assembly operations must take into account possible errors in parts placement and tolerances of the parts themselves. Previous approaches to this problem have been ...
  • Symbol IC-Evaluation as an Aid to Program Synthesis 
    Yonezawa, Akinori (MIT Artificial Intelligence Laboratory, 1976-04)
    Symbolic-evaluation is the process which abstractly evaluates an actor program and checks to see whether the program fulfills its contract (specification). In this paper, a formalism based on the conceptual representation ...
  • Symbolic Evaluation Using Conceptual Representations for Programs with Side-Effects 
    Yonezawa, Akinori; Hewitt, Carl (1976-12-01)
    Symbolic evaluation is a process which abstractly evaluates an program on abstract data. A formalism based on conceptual representations is proposed as a specification language for programs with side-effects. Relations ...
  • Symbolic Integration 
    Moses, Joel (1967-09-01)
    SIN and SOLDIER are heuristic programs in LISP which solve symbolic integration problems. SIN (Symbolic INtegrator) solves indefinite integration problems at the difficulty approaching those in the larger integral ...
  • Symbolic Integration 
    Moses, Joel (1966-06-01)
    A program has been written which is capable of integrating all but two of the problems solved by the Siagle's symbollic integration program SAINT. In contrast to SAINT, it is a purely algorithmic program and it has ...
  • Symbolic Integration II 
    Moses, Joel (1966-10-01)
    In this memo we describe the current state of the integration program originally described in AI Memo 97 (MAC-M-310). Familiarity with Memo 97 is assumed. Some of the algorithms described in that memo have been extended. ...
  • Symbolic Mathematical Laboratory 
    Martin, William A. (1967-01-01)
    A large computer program has been developed to aid applied mathematicians in the solution of problems in non-numerical analysis which involve tedious manipulations of mathematical expressions. The mathematician uses ...
  • Symmetric Set Theory: A General Theory of Isomorphism, Abstraction, and Representation 
    McAllester, David Allen (1983-08-01)
    It is possible to represent a finite set of points (atoms) by a finite sequence of points. However a finite set of points has no distinguished member and therefore it is impossible to define a function which takes a ...
  • Synapses That Compute Motion 
    Poggio, T.; Koch, C. (1987-06-01)
    Biophysics of computation is a new field that attempts to characterize the role in information processing of the several biophysical mechanisms in neurons, synapses, and membranes that have been uncovered in recent ...
  • Synchronizable Series Expressions: Part II: Overview of the Theory and Implementation 
    Waters, Richard C. (1987-11-01)
    The benefits of programming in a functional style are well known. In particular, algorithms that are expressed as compositions of functions operating on series/vectors/streams of data elements are much easier to ...
  • Syntactic Closures 
    Bawden, Alan; Rees, Jonathan (1988-06-01)
    In this paper we describe {\\it syntactic closures}. Syntactic closures address the scoping problems that arise when writing macros. We discuss some issues raised by introducing syntactic closures into the macro ...
  • Syntax and Display of Mathematical Expressions 
    Martin, William (1965-07-01)
    A LISP program converts a mathematical expression stored in list structure form, into a text-book style visual display. To do this, requires the selection and positioning of the individual symbols which make up the expression, ...
  • Syntax-Based Analytic Reading of Musical Scores 
    Forte, Allen (1967-04-01)
    As part of a larger research project in musical structure, a program has been written which "reads" scores encoded in an input language isomorphic to music notation. The program is believed to be the first of its kind. ...
  • Syntax of the New Language 
    Levin, Michael (1964-05-01)
    This is a definition of the syntax of the *** language. It consists of modifications and extensions of the "Revised Report on the Algorithmic Language ALGOL 60" which is printed in the "Communications of the ACM", January ...
  • Synthesis of a Network with a Given System Function 
    Sussman, Gerald Jay (MIT Artificial Intelligence Laboratory, 1974-06)
    I have just completed teaching two sections of 6.011 (Elementary Network Theory). One of the topics covered was synthesis of active filters by the "method of unilateral 2-ports". The explanation of this technique by the ...
  • The Synthesis of Force-Closure Grasps 
    Nguyen; Van-Duc (1985-09-01)
    This paper addresses the problem of synthesizing planar grasps that have force closure. A grasp on an object is a force closure grasp if and only if we can exert, through the set of contacts, arbitrary force and moment on ...
  • A Synthesis of Language Ideas for AI Control Structures 
    Kornfeld, William A. (MIT Artificial Intelligence Laboratory, 1980-07)
    Two well known programming methodologies for artificial intelligence research are compared, the so-called pattern-directed invocation languages and the object-oriented languages. The features and limitations of both ...
  • The Synthesis of Stable Force-Closure Grasps 
    Nguyen; Van-Duc (1986-07-01)
    This thesis addresses the problem of synthesizing grasps that are force-closure and stable. The synthesis of force-closure grasps constructs independent regions of contact for the fingertips, such that the motion of ...
  • The Synthesis of Stable Grasps in the Plane 
    Nguyen; Van-Duc (1985-10-01)
    This paper addresses the problem of synthesizing stable grasps on arbitrary planar polygons. Each finger is a virtual spring whose stiffnes and compression can be programmed. The contacts between the finger tips and the ...
  • Synthesis of Visual Modules from Examples: Learning Hyperacuity 
    Poggio, Tomaso; Fahle, Manfred; Edelman, Shimon (1991-01-01)
    Networks that solve specific visual tasks, such as the evaluation of spatial relations with hyperacuity precision, can be eastily synthesized from a small set of examples. This may have significant implications for the ...
MIT-Mirage