LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 301-303 of 486

    • Optimizing Synchronous Systems 

      Leiserson, Charles E.; Saxe, James B. (1982-03)
      The complexity of integrated-circuit chips produced today makes it feasible to build inexpensive, special-purpose subsystems that rapidly solve sophisticated problems on behalf of a general-purpose host computer. This paper ...

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

    • Minimax Optimal Universal Codeword Sets 

      Elias, Peter (1982-01)
      In an interactive multi-user data-processing system a user knows the probabilities of his messages and must encode them into a fixed system-wide variable-length codeword set. He needs to receive the answer to his last ...