242 search results - page 44 / 49 » Distributed algorithms with dynamical random transitions |
STOC
2001
ACM
15 years 9 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
94
Voted
ESA
2003
Springer
15 years 2 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
96
Voted
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
ICNP
2002
IEEE
15 years 2 months ago
2002
IEEE
We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only,...