| dc.date.accessioned | 2007-11-02T18:45:13Z | |
| dc.date.accessioned | 2018-11-24T10:25:44Z | |
| dc.date.available | 2007-11-02T18:45:13Z | |
| dc.date.available | 2018-11-24T10:25:44Z | |
| dc.date.issued | 2008-03 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/39418 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/39418 | |
| dc.description.abstract | 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 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.extent | 7 p. | en_US |
| dc.relation | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.relation | | en_US |
| dc.subject | amorphous computing | en_US |
| dc.subject | spatial computing | en_US |
| dc.subject | spatial computer | en_US |
| dc.title | Fast Self-Healing Gradients | en_US |
