Search
Now showing items 21-30 of 31
Amorphous Computing
(2007)
The goal of amorphous computing is to identify organizationalprinciples and create programming technologies for obtainingintentional, pre-specified behavior from the cooperation of myriadunreliable parts that are arranged ...
Fast Self-Healing Gradients
(2008-03)
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Self-healing gradients are a frequently used building block for distributed self-healing systems, but previous ...
Cognitive Security for Personal Devices
(2008-03-17)
Humans should be able to think of computers as extensions of their body, as craftsmen do with their tools. Current security models, however, are too unlike those used in human minds---for example, computers authenticate ...
Biologically-Inspired Robust Spatial Programming
(2005-01-18)
Inspired by the robustness and flexibility of biological systems, we are developing linguistic and programming tools to allow us to program spatial systems populated by vast numbers of unreliable components interconnected ...
An Algorithm for Bootstrapping Communications
(2001-08-13)
I present an algorithm which allows two agents to generate a simple language based only on observations of a shared environment. Vocabulary and roles for the language are learned in linear time. Communication is robust and ...
Leaderless Distributed Hierarchy Formation
(2002-12-01)
I present a system for robust leaderless organization of an amorphous network into hierarchical clusters. This system, which assumes that nodes are spatially embedded and can only talk to neighbors within a given radius, ...
Generating Communications Systems Through Shared Context
(2002-01-01)
In a distributed model of intelligence, peer components need to communicate with one another. I present a system which enables two agents connected by a thick twisted bundle of wires to bootstrap a simple communication ...
A Robust Amorphous Hierarchy from Persistent Nodes
(2003-05-01)
For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a hierarchy, but hierarchies ...
Near-Optimal Distributed Failure Circumscription
(2003-08-11)
Small failures should only disrupt a small part of a network. One way to do this is by marking the surrounding area as untrustworthy --- circumscribing the failure. This can be done with a distributed algorithm using ...
Leveraging Learning and Language Via Communication Bootstrapping
(2003-03-17)
In a Communication Bootstrapping system, peer components with different perceptual worlds invent symbols and syntax based on correlations between their percepts. I propose that Communication Bootstrapping can also be ...