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:

  • Minsky, Marvin; Papert, Seymour (1970-12-01)
    The MIT Artificial Intelligence Project has a variety of goals all bound together by search for principles of intelligent behavior. Among our immediate goals are to develop systems with practical applications for: ...
  • Minsky, Marvin; Papert, Seymour (1971-10-01)
    The activities of the Artificial Intelligence laboratory can be viewed under three main aspects; (1) Artificial Intelligence- understanding the principles of making intelligent machines along the lines discusses in ...
  • Winston, P.; Horn, B.K.P.; Sussman, G.J. (1973-09-01)
    The results of a decade of work in Artificial Intelligence have brought us to the threshold of a new phase of knowledge-based programming -- in which we can design computer systems that (1) react reasonably to significantly ...
  • Bloom, Burton H. (1963-02-01)
    The problem of devising a mechanical procedure for playing chess is fundamentally the problem of searching the very large move-tree associated with a chess position. This tree-searching problem is representative of a large ...
  • Papert, Seymour A. (1976-06-01)
    This proposal to the NSF describes a new phase of research planned in LOGO. Previous phases have concentrated on developing a conceptual superstructure (theories and teaching methods) and a material infra-structure ...
  • Winston, Patrick H. (1976-05-01)
    This is the substance of a proposal submitted in June, 1975, for research in the areas of large data bases and intelligent terminals, applications of machine vision and manipulation, basic studies in Artificial ...
  • Levin, Michael (1964-09-01)
    The instructions that transmit data between the index registers and the memory work only on the left half (address) portion of memory. These instructions are LDXn (load index n from address of storage word). And STXn (store ...
  • Hewitt, Carl (MIT Artificial Intelligence Laboratory, 1974-11)
    This paper presents a unified method [called ENCASING] for dealing with the closely related issues of synchronization and protection in actor systems [Hewitt et al. 1973a, 1973b, 1974a; Greif and Hewitt 1975]. Actors are ...
  • Hall, Miguel (1996-06-01)
    The MIT Prototype Educational Assessment System provides subjects and courses at MIT with the ability to perform online assessment. The system includes polices to handle harassment and electronic "flaming" while ...
  • Chockler, Gregory; Lynch, Nancy; Mitra, Sayan; Tauber, Joshua (2005-07-22)
    Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algorithms achieve atomicity has turned out ...
  • Bowring, Jim (1967-06-01)
    PSEG is a function of one argument--a region name which comes from REGIONLIST, as created by TOPOLOGIST. When it is done, the following data structure exists. *indicates that the data was already stored correctly when PSEG ...
  • Lozano-Perez, Tomas (MIT Artificial Intelligence Laboratory, 1976-12)
    This paper describes PSUDOC, a very simple LISP program to carry out some medical diagnosis tasks. The program's domain is a subset of clinical medicine characterized by patients presenting with edema and/or hematuria. The ...
  • Simosa, Jorge D. (2013-06-04)
    As modern networks become highly integrated, heterogeneous, and experience exponential growth, the task of network management becomes increasingly unmanageable for network administrators and designers. The Knowledge Plane ...
  • Jones, Joe L.; O'Donnell, Patrick A. (MIT Artificial Intelligence Laboratory, 1985-04)
    This document is intended to be a guide to assist a programmer in modifying or extending the Lisp Puma system, the Puma PDP-11 system, or the Cougar PDP-11 system. It consists mostly of short descriptions or hints, and is ...
  • Grauman, Kristen; Darrell, Trevor (2005-03-17)
    Discriminative learning is challenging when examples are setsof local image features, and the sets vary in cardinality and lackany sort of meaningful ordering. Kernel-based classificationmethods can learn complex decision ...
  • Grauman, Kristen; Darrell, Trevor (2006-03-18)
    Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification methods can learn complex decision boundaries, ...
  • Shashua, Amnon; Toelg, Sebastian (1994-06-01)
    The conceptual component of this work is about "reference surfaces'' which are the dual of reference frames often used for shape representation purposes. The theoretical component of this work involves the question ...
  • Williams, Brian C. (1984-07-01)
    With the push towards sub-micron technology, transistor models have become increasingly complex. The number of components in integrated circuits has forced designer's efforts and skills towards higher levels of design. ...
  • Kleer, Johan De (1975-12-01)
    This thesis investigates what knowledge is necessary to solve mechanics problems. A program NEWTON is described which understands and solves problems in mechanics mini-world of objects moving on surfaces. Facts and ...
  • Weinshall, Daphna (1987-12-01)
    Obtaining exact depth from binocular disparities is hard if camera calibration is needed. We will show that qualitative depth information can be obtained from stereo disparities with almost no computations and with ...
MIT-Mirage