23 search results - page 5 / 5 » Name-independent compact routing in trees |
SENSYS
2004
ACM
13 years 11 months ago
2004
ACM
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
SENSYS
2009
ACM
14 years 17 days ago
2009
ACM
The programming and retasking of sensor nodes could benefit greatly from the use of a virtual machine (VM) since byte code is compact, can be loaded on demand, and interpreted on...
APPML
2007
13 years 5 months ago
2007
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...