Show simple item record

dc.contributor.advisorGerald Sussmanen_US
dc.contributor.authorBeal, Jacoben_US
dc.contributor.authorBachrach, Jonathanen_US
dc.contributor.authorVickery, Danen_US
dc.contributor.authorTobenkin, Marken_US
dc.contributor.otherMathematics and Computationen_US
dc.date.accessioned2007-11-02T18:45:13Z
dc.date.available2007-11-02T18:45:13Z
dc.date.issued2008-03en_US
dc.identifier.otherMIT-CSAIL-TR-2007-050en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/39418
dc.description.abstractWe 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 algorithms either have a healing rate limited by the shortest link in the network or must rebuild invalid regions from scratch. We have verified CRF-Gradient in simulation and on a network of Mica2 motes. Our approach can also be generalized and applied to create other self-healing calculations, such as cumulative probability fields.en_US
dc.format.extent7 p.en_US
dc.relationMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratoryen_US
dc.relationen_US
dc.subjectamorphous computingen_US
dc.subjectspatial computingen_US
dc.subjectspatial computeren_US
dc.titleFast Self-Healing Gradientsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record