Sciweavers

24095 search results - page 4472 / 4819
» Researchers and Development - Young Researches
Sort
View
IPSN
2004
Springer
16 years 4 days ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
IPSN
2004
Springer
16 years 4 days ago
The impact of spatial correlation on routing with compression in wireless sensor networks
The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. While several data aggregation (i.e., routing with...
Sundeep Pattem, Bhaskar Krishnamachari, Ramesh Gov...
IPTPS
2004
Springer
16 years 4 days ago
Cluster Computing on the Fly: P2P Scheduling of Idle Cycles in the Internet
— Peer-to-peer computing, the harnessing of idle compute cycles throughout the Internet, offers exciting new research challenges in the converging domains of networking and distr...
Virginia Mary Lo, Daniel Zappala, Dayi Zhou, Yuhon...
MFCS
2004
Springer
16 years 4 days ago
Boxed Ambients with Communication Interfaces
We define BACI (Boxed Ambients with Communication Interfaces), an ambient calculus with a flexible communication policy. Traditionally, typed ambient calculi have a fixed commu...
Eduardo Bonelli, Adriana B. Compagnoni, Mariangiol...
NOSSDAV
2004
Springer
16 years 4 days ago
Reduced state fair queuing for edge and core routers
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
Ramana Rao Kompella, George Varghese
« Prev « First page 4472 / 4819 Last » Next »