This paper demonstrates that it is possible to generate a reasonably accurate coordinate system on randomly distributed processors, using only local information and local communication. By coordinate systems we imply that each element assigns itself a logical coordinate that maps…

This report develops a conceptual framework in which to talk about mathematical knowledge. There are several broad categories of mathematical knowledge: results which contain the traditional logical aspects of mathematics; examples which contain illustrative material; and concepts which include formal…

by Shawn W. Ritchie., Thesis (S.M.)--Massachusetts Institute of Technology, System Design and Management Program, 1999., Includes bibliographical references (leaves 80-81).

by Roberta M. Braum., Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999., Includes bibliographical references (p. 57).

by Gloria G. Moncayo., Thesis (M.B.A.)--Massachusetts Institute of Technology, Sloan School of Management, 1999., Includes bibliographical references (leaves 87-88).

by Leslie Prince Rudolph., Thesis (M.B.A.)--Massachusetts Institute of Technology, Sloan School of Management; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1999., Includes bibliographical references (leaves 70-72).

by Qi Dong., Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1999., Includes bibliographical references (p. 169-171).

by Gregory K. Clancey., Thesis (Ph.D.)--Massachusetts Institute of Technology, Program in Science, Technology and Society, 1999., Includes bibliographical references.

With the rapid increase in low-cost and sophisticated digital technology the need for techniques to authenticate digital material will become more urgent. In this paper we address the problem of authenticating digital signals assuming no explicit prior knowledge of the…

We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other…