Sciweavers

831 search results - page 87 / 167
» Adapting to a reliable network path
Sort
View
PERCOM
2010
ACM
15 years 10 months ago
Adaptive deployment for pervasive data gathering in connectivity-challenged environments
—Some current and future pervasive data driven applications must operate in ”extreme” environments where endto-end connectivity cannot be guaranteed at all times. In fact, it...
Tahiry Razafindralambo, Nathalie Mitton, Aline Car...
GLVLSI
2010
IEEE
210views VLSI» more  GLVLSI 2010»
15 years 11 months ago
Overscaling-friendly timing speculation architectures
Processors have traditionally been designed for the worst-case, resulting in designs that have high yields, but are expensive in terms of area and power. Better-than-worst-case (B...
John Sartori, Rakesh Kumar
GLOBECOM
2009
IEEE
15 years 3 months ago
Cooperative Communications with Relay Selection for QoS Provisioning in Wireless Sensor Networks
Abstract--Cooperative communications have been demonstrated to be effective in combating the multiple fading effects in wireless networks, and improving the network performance in ...
Xuedong Liang, Ilangko Balasingham, Victor C. M. L...
CCR
2000
96views more  CCR 2000»
15 years 5 months ago
Decentralized optimal traffic engineering in the internet
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Constantino M. Lagoa, Hao Che
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
16 years 4 days ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...