Search
Now showing items 1-10 of 30
Principles for Engineered Emergence (slides)
(2007-04-12)
Principles for Engineered EmergenceIt is difficult to establish engineering control over the behavior ofaggregates of unreliable devices with complicated interactionpatterns. I take a linguistic view of this problem, ...
Learning by Learning To Communicate
(2007-08-23)
Human intelligence is a product of cooperation among many different specialists. Much of this cooperation must be learned, but we do not yet have a mechanism that explains how this might happen for the "high-level" agile ...
Programming a Sensor Network as an Amorphous Medium
(2006-06)
In many sensor network applications, the network is deployedto approximate a physical space. The network itself is not ofinterest: rather, we are interested in measuring the propertiesof the space it fills, and of establishing ...
Code for LOLCAT Method (Variant of Gillespie Algorithm)
(2009-09-04)
This code and data is publicly listed code for the LOLCAT Method developed by Sagar Indurkhya and Jacob Beal, in the paper: "Reaction factoring and bipartite update graphs accelerate the Gillespie algorithm for large-scale ...
RamboNodes for the Metropolitan Ad Hoc Network
(2003-12-17)
We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
Near-Optimal Distributed Failure Circumscription
(2003-08-11)
Small failures should only disrupt a small part of a network. One wayto do this is by marking the surrounding area as untrustworthy ---circumscribing the failure. This can be done with a distributedalgorithm using ...
What the Assassin's Guild Taught Me About Distributed Computing
(2006-05-27)
Distributed computing and live-action roleplaying share many of thesame fundamental problems, as live-action roleplaying games commonly include simulations carried out by their players.Games run by the MIT Assassin's Guild ...
Building Spatial Computers
(2007-03-14)
Programmability is a major challenge in spatial computing, anaggregate control problem found in domains such as sensor networks,swarm robotics, and modular robotics. We address this challenge witha model of a spatial ...
Constraint and Restoring Force
(2007-08-24)
Long-lived sensor network applications must be able to self-repair and adapt to changing demands. We introduce a new approach for doing so: Constraint and Restoring Force. CRF is a physics-inspired framework for computing ...
Programming an Amorphous Computational Medium
(2004-09)
Amorphous computing considers the problem of controllingmillions of spatially distributed unreliable devices which communicateonly with nearby neighbors. To program such a system, we need a highleveldescription language ...