Sciweavers

1484 search results - page 259 / 297
» Ants meeting algorithms
Sort
View
MOBIHOC
2008
ACM
15 years 9 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei
MOBIHOC
2005
ACM
15 years 9 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
SOSP
2003
ACM
15 years 6 months ago
Bullet: high bandwidth data dissemination using an overlay mesh
In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
CGO
2010
IEEE
15 years 4 months ago
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
Hongtao Yu, Jingling Xue, Wei Huo, Xiaobing Feng 0...
IPPS
2009
IEEE
15 years 4 months ago
A resource allocation approach for supporting time-critical applications in grid environments
— There are many grid-based applications where a timely response to an important event is needed. Often such response can require a significant computation and possibly communic...
Qian Zhu, Gagan Agrawal