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:

  • Givan, Robert; McAllester, David; Shalaby, Sameer (1991-12-01)
    We have previously argued that the syntactic structure of natural language can be exploited to construct powerful polynomial time inference procedures. This paper supports the earlier arguments by demonstrating that a ...
  • Bobrow, Daniel G. (1964-03-01)
    This paper describes a computer program which accepts and "understands" a comfortable, but restricted set of one natural language, English. Certain difficulties are inherent in this problem of making a machine "understand" ...
  • McAllester, David; Givan, Robert (1989-10-01)
    We have argued elsewhere that first order inference can be made more efficient by using non-standard syntax for first order logic. In this paper we show how a fragment of English syntax under Montague semantics provides ...
  • Miller, Laurence (1981-10-01)
    This memo reports the results of a case study into how children learn in the absence of explicit teaching. The three subjects, an eight year old, a ten year old and a thirteen year old were observed in both of two ...
  • Minsky, Marvin (1981-08-01)
    Imagine a crystalline world of tiny, discrete "cells", each knowing only what its nearest neighbors do. Each volume of space contains only a finite amount of information, because space and time come in discrete units. ...
  • Beal, Jacob (2003-08-11)
    Small failures should only disrupt a small part of a network. One way to do this is by marking the surrounding area as untrustworthy --- circumscribing the failure. This can be done with a distributed algorithm using ...
  • Davis, Randall; Smith, Reid G. (1981-05-01)
    We describe the concept of distributed problem solving and define it as the cooperative solution of problems by a decentralized and loosely coupled collection of problem solvers. This approach to problem solving offers ...
  • Katzenelson, Jacob; Unikovski, Aharon (1995-08-01)
    The MOS transistor physical model as described in [3] is presented here as a network model. The goal is to obtain an accurate model, suitable for simulation, free from certain problems reported in the literature [13], and ...
  • Girosi, Federico; Poggio, Tomaso (1989-10-01)
    Networks can be considered as approximation schemes. Multilayer networks of the backpropagation type can approximate arbitrarily well continuous functions (Cybenko, 1989; Funahashi, 1989; Stinchcombe and White, 1989). We ...
  • Minsky, Marvin (1963-03-01)
    A number of models developed in work often called "neural-net" research may be of interest to physiologists working on the problem of memory. From this work comes a variety of ideas on how networks of neuron-like elements ...
  • Cohn, David A. (1994-06-01)
    We consider the question "How should one act when the only goal is to learn as much as possible?" Building on the theoretical results of Fedorov [1972] and MacKay [1992], we apply techniques from Optimal Experiment ...
  • Jordan, Michael I.; Bishop, Christopher M. (1996-03-13)
    We present an overview of current research on artificial neural networks, emphasizing a statistical perspective. We view neural networks as parameterized graphs that make probabilistic assumptions about data, and view ...
  • Shrobe, Howard; Laddaga, Robert (2004-02-09)
    Traditionally, we've focussed on the question of how to make a system easy to code the first time, or perhaps on how to ease the system's continued evolution. But if we look at life cycle costs, then we must conclude ...
  • Levin, Michael (1964-05-01)
    These conventions are for the implementation of the new language on a large computer on which time-sharing is the standard role of operation. Each user is at any time asigned a certain amount of primary storage. This ...
  • Griffith, Arnold (1966-03-01)
    This paper described a recent refinement of the machine--learning process employed by Samuel (1) in connection with his development of a checker playing program. Samuels checker player operates in much the same way a ...
  • Fenichel, Robert R.; Moses, Joel (1966-02-01)
    A new version of the CTSS LISP is now available. The new system provides additional data storage and several new functions and constants. The I/O capabilities, EXCISE, the error comments, and several routines have ...
  • Papert, Seymour; Solomon, Cynthia (1970-01-01)
    This note illustrates some ideas about how to initiate beginning students into the art of planning and writing a program complex enough to be considered a project rather than an exercise on using the language or simple ...
  • Caprile, Bruno; Girosi, Federico (1990-09-01)
    The problem of minimizing a multivariate function is recurrent in many disciplines as Physics, Mathematics, Engeneering and, of course, Computer Science. In this paper we describe a simple nondeterministic algorithm ...
  • Lumsdaine, A.; Wyatt, J.L., Jr.; Elfadel, I.M. (1991-01-01)
    Image smoothing and segmentation algorithms are frequently formulatedsas optimization problems. Linear and nonlinear (reciprocal) resistivesnetworks have solutions characterized by an extremum principle. Thus,sappropriately ...
  • Poggio, T.; Koch, C. (1981-09-01)
    In a dendritic tree transient synaptic inputs activating ionic conductances with an equilibrium potential near the resting potential can veto very effectively other excitatory inputs. Analog operations of this type can ...
MIT-Mirage