Browsing LCS Publications by Title

Now showing items 1062-1081 of 1163

    • A T=0(2^n/2), S=0(2^n/4) Algorithm for Certain NP-Complete Problems 

      Schroeppel, Richard; Shamir, Adi (1980-01)
      In this paper we develop a general prupose algorithm that can solve a number of NP-complete problems in time T=0(2^n/2) and space S=0(2^n/4). The algorithm can be generalized to a family of algorithms whose time and space ...

    • Task Scheduling in the Control Robotics Environment 

      Mok, Aloysius Ka-Lau (1976-09)
      Scheduling problems involved in Control Robotics, a software approach to control engineering are studied. The capability of a multiprocessor system to handle tasks with hard, real-time deadlines is investigated according ...

    • TCP Packet Trace Analysis 

      Shepard, Timothy Jason (1991-02)
      Examination of a trace of packets collected from the network is often the only method available for diagnosing protocol performance problems in computer networks. This thesis explores the use of packet traces to diagnose ...

    • TCP-friendly Congestion Control for Real-time Streaming Applications 

      Bansal, Deepak; Balakrishnan, Hari (2000-05)
      This paper introduces and analyzes a class of nonlinear congestion control algorithms called binomial algorithms, motivated in part by the needs of streaming audio and video applications for which a drastic reduction in ...

    • Teaching Policy to Computer Science Students 

      Blumenthal, Marjory S. (1998-12)
      Computing motivates more and more attention by policy-makers at all levels of government, and policy interests of all kind can touch on computer scienceÔøΩboth inspiring new research directions or constraining technology ...

    • A Technique for Constructing Highly-Available Services 

      Ladin, Rivka; Liskov, Barbara; Shrira, Liuba (1988-01)
      This paper describes a general method for constructing a highly available service for use in a distributed system. It gives a specific implementation of the method and proves the implementation correct. The service ...

    • Techniques for Increasing and Detecting Memory Alignment 

      Larsen, Samuel; Witchel, Emmett; Amarasinghe, Saman (2001-11)
      Memory alignment is an important property in memory system performance. Extraction of alignment information at compile-time enables the possibility for new classes of program optimization. In this paper, we present methods ...

    • A Telex Gateway for the Internet 

      Meier zu Sieker, Friedrich (1982-05)
      The design of a gateway connecting one of the networks of the MIT Laboratory for Computer Science to the telex network is discussed. A description of the telex network is given. The relationship of the gateway to other ...

    • Temporal Reasoning in Medical Expert Systems 

      Kohane, Isaac S. (1987-05)
      Diseases develop and change over time. Much of the distinction between pathophysiological complexes rests on the temporal relations of their component events. Therefore, knowledge bases that fail to capture the temporal ...

    • Temporally Coherent Conservative Visibility 

      Coorg, Satvan; Teller, Seth (1995-11)
      Efficiently identifying polygons that are visible from a changing synthetic viewpoint is an important problem in computer graphics. even with hardware support, simple algorithms like depth-buffering cannot achieve interactive ...

    • Ten Thousand and One Logics of Programming 

      Meyer, Albert R. (1980-02)

    • Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability 

      Meyer, Albert R.; Mitchell, John C. (1982-03)
      The termination assertion p<S>q means that whenever the formular p is true, there is an execution of the possibly nondeterministic program S which terminates in a state in qhich q is true. A recursive program S may declare ...

    • Tetris is Hard, Even to Approximate 

      Demaine, Erik D.; Hohenberger, Susan; Liben-Nowell, David (2002-10)

    • A Theoretical and Practical Approach to Instruction Scheduling on Spatial Architectures 

      Mirrokni, Vahab S.; Lee, Walter; Karger, David; Amarasinghe, Saman (2002-12)
      This paper studies the problem of instruction assignment and scheduling on spatial architectures. Spatial architectures are architectures whose resources are organized in clusters, with non-zero communication delays between ...

    • Theory and Practice of Text Editors or A Cookbook for an Emacs 

      Finseth, Craig A. (1980-05)
      A comprehensive summary of the available technology for implementing text editors. It is written to be a guide for the implementor of a text editor. It does not provide a finished, polished algorithm for any part of a text ...

    • A Theory of Clock Synchronization 

      Patt, Boaz (1994-10)
      We consider the problem of clock synchronization in a system with uncertain message delays and clocks with bounded drift. To analyze this classical problem, we introduce the concept of synchronization graphs, and show that ...

    • Theory of Computation Group Research Summary June 1985 - July 1986 

      Theory of Computation Group (1986-08)

    • Theory of Computation Group Research Summary June 1988 - July 1989 

      Theory of Computation Group (1989-07)

    • Theta Reference Manual 

      Liskov, Barbara; Curtis, Dorothy; Day, Mark; Ghemawat, Sanjay; Gruber, Robert; e.a. (1995-02)

    • Three Methods for Range Queries in Computational Geometry 

      Kipnis, Shlomo (1989-03)
      This paper surveys a variety of recent results addressing the problem of range queries in computational geometry. The major contribution of this paper is in identifying three general methods for range queries in computational ...