Now showing items 830-849 of 1163

    • Probabilistic Reasoning in the Domain of Genetic Counseling 

      Harris, Nomi L. (1989-10)
      This paper describes a program, GENINFER, which uses belief networks to calculate risks of inheriting genetic disorders. GENINFER is based on Judea Pearl's [17] algorithm for fusion and propagation in probabilistic belief ...
    • Probabilistic Searching in Sorted Linked Lists 

      Leighton, Frank Thomson; Lepley, Margaret (1983-11)
      Janko [2] and Bentley, Stanat, and Steele [1] have described probabilistic procedures for data manipulation in sorted linnked lists. Their procedures are based on an algorithm which performs a Member search operation using ...
    • Procedural Reflection in Programming Languages Volume I 

      Smith, Brian Cantwell (1982-01)
      We show how a computational system can be constructed to "reason," effectively and consequentially, about its own inferential processes. The analysis proceeds in two parts. First, we consider the general question of ...
    • Proceedings of the 1992 MIT Student Workshop on VLSI and Parallel Systems 

      Leiserson, C.E. (1992-07)
      Proceedings of the 1992 MIT Student Workshop on VLSI and Parallel Systems. The papers in this volume were submitted to the 1992 MIT Student Workshop on VLSI and Parallel Systems. The workshop was organized by the VLSI and ...
    • A Process Algebraic View of I/O Automata 

      Segala, Roberto (1992-06)
      The Input/Output Automata formalism of Lynch and Tuttle is a widely used framework for the specification and verification of concurrent algorithms. Unfortunately, it has never been provided with an algebraic characterization, ...
    • Processor Multiplexing in a Layered Operating Systems 

      Reed, David Patrick (1976-07)
      This thesis presents a simply structured design for the implementation of process in a kernel-structured operating system. The design provides a minimal mechanism for the support of two distinct classes of processes found ...
    • Producing Explanations and Justifications of Expert Consulting Programs 

      Swartout, William R. (1981-01)
      Traditional methods for explaining programs provide explanations by converting to English the code of the program or traces of the execution of that code. While such methods can provide adequate explanations of what the ...
    • Productivity in Parallel Computational Schemata 

      Linderman, John P. (1973-12)
      A general model for parallel computation is developed in three parts. One part, the data flow graph, describes how actors which transform and test values are connected to the locations in a finite memory. Another part, ...
    • Program Analysis by Digital Computer 

      Wilde, Daniel Underwood (1967-08)
      A comparison of the properties of non-modifying and self-modifying programs leads to the definition of independent and dependent instructions. Because non-modifying programs contain only independent instructions, such ...
    • A Program for Generating and Analyzing Term Rewriting Systems 

      Forgaard, Randy (1984-09)
      This thesis presents new results in the use of term rewriting systems for automatic theorem proving. The design and implementation of REVE 2, a computer program that incorporates these results, is described. In addition, ...
    • A Program for the Design of Procurement Systems 

      Bosyj, Michael (1976-05)
      Computer technology has had a limited success in producing useful business applications. Management systems seldom meet users' requirements, are often inappropriate to an application, and are frequently abandoned. But ...
    • A Program for Therapy of Acid-base and Electrolyte Disorders 

      Bromley, Hank (1983-06)
      This thesis describes work done on the therapy component of an on-going project for the diagnosis and management of acid-base and electrolyte disoders. Therapeutic interventions can be classified as symptomatic or etiologic, ...
    • Program Restructuring for Virtual Memory Systems 

      Johnson, Jerry William (1975-03)
      The problem area addressed in this report is program restructuring, a method of reordering the relocatable sectors of a program in its address space to increase the locality of the programs reference behavior, thereby ...
    • Program Structure in a Multi-access Computer 

      Dennis, Jack B. (1964-05)
      A multi-access computer (MAC) system consists of processing units and directly addressable main memory in which procedure information is interpreted as sequences of operations on data, a system of terminal devices ...
    • Programming Language Techniques for Modular Router Configurations 

      Kohler, Eddie; Chen, Benjie; Kaashoek, M. Frans; Morris, Robert T.; Poletto, Massimiliano (2000-08)
      This paper applies programming language techniques to a high-level system description, both to optimize the system and to prove useful properties about it. The system in question is Click, a modular software router framework. ...
    • Programming Semantics for Multiprogrammed Computations 

      Dennis, Jack B.; Van Jhorn, Earl C. (1965-12)
      The semantics are defined for a number of meta-instructions which perform operations essential to the writing of programs in multiprogrammed computer systems. These meta-instructions relate to parallel procession, protection ...
    • Programming Simultaneous Action Using Common Knowledge 

      Moses, Yoram; Tuttle, Mark R. (1987-02)
      This work applies the theory of knowledge in distributed systems to the design of efficient fault-tolerant protocols. We define a large class of problems requiring coordinated, simultaneous action in synchronous systems, ...
    • A Programming system for the Dynamic Manipulation of Temporally Sensitive Data 

      Lindblad, Christopher J. (1994-08)
      In computer-participative multimedia applications, the computer not only manipulates media, but also digests it and performs independent actions based on media content. In this report I discuss an approach to the design ...
    • Proposal for a Small Scheme Implementation 

      Schooler, Richard; Stamos, James W. (1984-10)
      Scheme is a lexically scoped dialect of LISP developed at MIT. In this report we determine the feasibility of implementing a Scheme-based programming/application environment on a contemporary personal computer such as the ...
    • The Propositional Dynamic Logic of Deterministic, Well-Structured Programs 

      Halpern, Joseph Y.; Reif, John H. (1981-03)
      We consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dynamic Logic (SDPDL), which is appropriate for reasoning about deterministic well-structured programs. In contrast to PDL, for which ...