Sciweavers

39 search results - page 8 / 8
» SPEED: Symbolic Complexity Bound Analysis
Sort
View
MOBIHOC
2008
ACM
14 years 4 months ago
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Recent research shows that significant energy saving can be achieved in wireless sensor networks with a mobile base station that collects data from sensor nodes via short-range co...
Guoliang Xing, Tian Wang, Weijia Jia, Minming Li
RTSS
2003
IEEE
13 years 10 months ago
Data Caches in Multitasking Hard Real-Time Systems
Data caches are essential in modern processors, bridging the widening gap between main memory and processor speeds. However, they yield very complex performance models, which make...
Xavier Vera, Björn Lisper, Jingling Xue
INFOCOM
1997
IEEE
13 years 9 months ago
A Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
Dallas E. Wrege, Jörg Liebeherr
PODC
2009
ACM
14 years 5 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...