Browsing LCS Technical Memos (1974 - 2003) by Title
Now showing items 336-355 of 492
-
PAC-Learning Prolog Clauses With or Without Errors
(1994-02)Recently researchers have been interested in trying to expand the domain of learnability to subsets of first-order logic, in particular Prolog programs. This new research area has been named Inductive Logic Programming ... -
Packet Trains: Measurements and a New Model for Computer Network Traffic
(1985-11)Traffic measurements on a ring local area computer network at Massachusetts Institute of Technology are presented. The analysis of the arrival pattern shows that the arrival processes are neither Poisson nor Compound ... -
Parameterized Types and Java
(1996-05)Java offers the real possibility that most programs can be written in a type-safe language However, for Java to be broadly useful, it needs additional expressive power. This paper extends Java in one area where more power ... -
Patterns in Trees
(1985-01)A very general enumeration formula for occurences of a pattern, or set of patterns, in the class of ordered trees with a given number of edges is presented, and its wide usefulness is demonstrated. -
Persistence of Vector Replacement Systems is Decidable
(1981-01)In a persistent vector replacement system (VRS) or Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which allows to decide whether an arbitrary VRS is persistent ... -
Persona: A Contextualized and Personalized Web Search
(2001-05)Recent advances in graph-based search techniques derived from Kleinberg's work [1] have been impressive. This paper further improves the graph-based search algorithm in two dimensions. Firstly, variants of Kleinberg's ... -
Phased Computation Graphs in the Polyhedral Model
(2002-08)We present a translation scheme that allows a broad class of dataflow graphs to be considered under the optimization framework of the polyhedral model. The input to our analysis is a Phased Computation Graph, which we ... -
Piecemeal Graph Exploration by a Mobile Robot*
(1995-01)We study how a mobile robot can piecemeal learn an unknown environment. The robot's goal is to learn a complete map of its environment, while satisfying the constraint that it must return every so often to its starting ... -
Planar Embedding of Planar Graphs
(1983-02)Planar embedding with minimal area of graphs on an integer grid is an interesting problem in VLSI theory. Valiant [V] gave an algorithm to construct a planar embedding for trees in linear area; he also proved that there ... -
PLY: A System of Plausibility Inference with a Probabilistic Basis
(1982-12)An overview is given of a system of plausibility inference that will be developed for use in planning. This system, to be called PLY, will be specifically designed to work with propositions of the form "when A is true ... -
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
(1995-09)We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new type of homing sequence for robots, which helps ... -
The Power of the Queue
(1986-04)Queues, stacks (pushdown stores), and tapes are storage models which have direct applications in compiler design and the general desig of algorithms. Whereas stacks (pushdown store or last-in-first-out storage) have been ... -
A Principled Design for an Integrate Computational Environment
(1982-07)Boxer is a computer language designed to be the base of an integrated computational environment providing a broad array of functionality -- from text editing to programming -- for naïve and novice users. It stands in the ... -
Probabilistic Analysis of a Network Resource Allocation Algorithm
(1985-06)A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, one allocated, are never ... -
Probabilistic Searching in Sorted Linked Lists
(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 ... -
A Program for Therapy of Acid-base and Electrolyte Disorders
(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, ... -
Proposal for a Small Scheme Implementation
(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
(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 ...
