Browsing LCS Publications by Title

Now showing items 890-909 of 1163

    • Reasoning about Preference Models 

      Wellman, Michael Paul (1985-05)
      Programs that make decisions need mechanisms for representing and reasoning about the desirability of the possible consequences of their choices. This work is an exploration of preference models based on utility theory. ...

    • Recognition of Translators Invariants* By Iterative Arrays 

      Beyer, Wendel Terry (1969-10)
      A study is made of the recognition and transformation of figures by iterative arrays of finite state automata. A figure is a finite rectangular two-dimensional array of symbols. The iterative arrays considered are also ...

    • Record of the Workshop on Research in Office Semantics 

      Barber, Gerald R. (1981-02)
      This paper is a compendium of the ideas and issues presented at the Chatham Bars Workshop of Office Semantics. The intent of the workshop was to examine the state of the art in office systems and to elucidate the issues ...

    • Recovery of the Swallow Repository 

      Arens, Gail C. (1981-01)
      This thesis presents the design of a set of recovery mechanisms for the Swallow repository. Swallow is a distributed data storage system that supports highly reliable long term storage of arbitrary sized data objects with ...

    • Recursion Theoretic Operators and Morphisms on Numbered Sets 

      Barendregt, Henk; Longo, Giuseppe (1981-02)
      An operator is a map ?: Pω->Pω. By embedding Pω in two natural ways into the λ-calculus model Pω^2 (and T^ω) the computable maps on this latter structure induce several classes of recursion theoretic operators.

    • Recursive Decomposition Ordering and Multiset Orderings 

      Jouannaud, Jean-Pierre; Lescanne, Pierre; Reinig, Fernand (1982-06)
      The Recursive Decomposition Ordering, a simplification ordering on terms, is useful to prove termination of term rewriting systems. In this paper we give the definition of the decomposition ordering and prove that it is a ...

    • Reducing Synchronization Overhead in Parallel Simulation 

      Legedza, Ulana (1995-05)
      Synchronization is often the dominant cost in conservative parallel simulation, particularly in simulations of parallel computers, in which low-latency simulated communication requires frequent synchronization. This thesis ...

    • The Reduction Method for Establishing Lower Bounds on the Number of Additions 

      Kedem, Zvi M. (1974-06)
      A method for establishing lower bounds on the number of multiplications and divisions has been developed by Pan, Winograd and Strassen. A similar method is developed for establishing lower bounds on the number of additions ...

    • Regions: A Scalable Infrastructure for Scoped Service Location in Ubiquitous Computing 

      Benedicto, Kathryn Flores (1999-05)
      Until recently, most efforts in service location have focused on finding local services. However, service location is also useful in large-scale networked environments containing numerous, possibly non-local services. ...

    • The Relational Approach to the Management of Data Bases 

      Strnad, Alois J. (1971-04)
      The ultimate goal of Project MacAIMS (MAC Advanced Interactive Management System) is to build a computer facility which will be able to support non-trivial decision making processes. (See reference 4). In the early stages ...

    • A Relative-motion Microworld 

      Morecroft, Linda E. (1985-09)
      A relative-motion microworld has been designed to aid high-school students in understanding the concepts of relative motion and frames of reference. Relative motion and frames of reference are usually introduced in a ...

    • Relativization of the Theory of Computational Complexity 

      Lynch, Nancy A. (1972-06)
      Blum's machine-independent treatment of the complexity of partial recursive functions is extended to relative algorithms (as represented by Turing machines with oracles). We prove relativizations of several results of ...

    • Reliable Communication Over Unreliable Channels 

      Afek, Yehuda; Attiya, Hagit; Fekete, Alan; Fischer, Michael; Lynch, Nancy A.; e.a. (1992-10)
      Layered communication protocols frequently implement a FIFO message facility on top of an unreliable non-FIFO service such as that provided by a packet-switching network. This paper investigates the possibility of implementing ...

    • Reliable Object Storage to Support Atomic Actions 

      Oki, Brian Masao (1983-05)
      To preserve the consistency of on-line, long-lived, distributed data in the presence of concurrency and in the event of hardware failures, it is necessary to ensure atomicity and data resiliency in applications. The ...

    • Relieving Hot Spots on the World Wide Web 

      Panigrahy, Rina (1997-06)
      We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Hot spots are web sites that swamped by a large number of requests ...

    • Remote Evaluation 

      Stamos, James William (1986-01)
      A new technique for computer-to-computer communication is presented that can increase the generality and performance of distributed systems. This technique, called Remote Evaluation, lets one computer send another computer ...

    • Remote Pipe and Procedures for Efficient Distributed Communication 

      Gifford, D. (1986-10)
      A new communication model for distributed systems is described that combines the advantages of remote procedure call with the efficient transfer of bulk data. Three ideas form the basis of this model. First, remote ...

    • Removing the Dynamic Linker from the Security Kernel of a Computing Utility 

      Jason, Philippe Arnaud (1974-06)
      In order to enforce the security of the information stored in a computing utility, it is necessary to certify that the protection mechanism is correctly implemented so that there exist no uncontrolled access path to the ...

    • Reordering with Hindsight 

      Spiers, Bradford T. (1993-10)
      This report presents the reordering technique for parallel debugging. This technique is useful for debugging ordering errors, caused when actions a programmer meant to occur in a specific order occur in a different, ...

    • Replication and Reconfiguration in a Distributed Mail Repository 

      Day, Mark S. (1987-04)
      Conventional approaches to programming produce centralized programs that run on a single computer. However, an unconventional approach can take advantage of low-cost communication and small, inexpensive computers. A ...