Now showing items 668-687 of 1217

    • Natural Language Based Inference Procedures Applied to Schubert's Steamroller 

      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 ...
    • Natural Language Input for a Computer Problem Solving System 

      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" ...
    • Natural Language Syntax and First Order Preference 

      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 ...
    • Natural Learning 

      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 ...
    • Nature Abhors an Empty Vacuum 

      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. ...
    • Near-Optimal Distributed Failure Circumscription 

      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 ...
    • Negotiation as a Metaphor for Distributed Problem Solving 

      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 ...
    • A Network Charge-Orineted MOS Transistor Model 

      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 ...
    • Networks and the Best Approximation Property 

      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 ...
    • Neural Nets and Theories of Memory 

      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 ...
    • Neural Network Exploration Using Optimal Experiment Design 

      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 ...
    • Neural Networks 

      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 ...
    • New Architectural Models for Visibly Controllable Computing: The Relevance of Dynamic Object Oriented Architectures and Plan Based Computing Models 

      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 ...
    • New Language Storage Conventions 

      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 ...
    • A New Machine-Learning Technique Applied to the Game of Checkers 

      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 ...
    • A New Version of CTSS LISP 

      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 ...
    • NIM: A Game-Playing Program 

      Papert, Seymour A.; 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 ...
    • Non-Monotonic Logic I 

      McDermott, Drew; Doyle, Jon (1978-08-01)
      "Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate old theorems. Such logics are very important in modeling the beliefs of active processes which, acting in the presence ...
    • Non-Monotonic Logic I 

      McDermott, Drew; Doyle, Jon (1979-01-01)
      "Non-monotonic" logical systems are logics in which the introduction of new axioms can invalidate old theorems. Such logics are very important in modeling the beliefs of active processes which, acting in the presence ...
    • Non-Rigid Motion and Regge Calculus 

      Jasinschi, Rado; Yuille, Alan (1987-11-01)
      We study the problem of recovering the structure from motion of figures which are allowed to perform a controlled non-rigid motion. We use Regge Calculus to approximate a general surface by a net of triangles. The ...