Sciweavers

2518 search results - page 472 / 504
» Using Communication Objects During Requirements Analysis
Sort
View
MOBICOM
2004
ACM
15 years 5 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
SPAA
1996
ACM
15 years 4 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
ENTCS
2006
176views more  ENTCS 2006»
14 years 12 months ago
Gauss: A Framework for Verifying Scientific Computing Software
High performance scientific computing software is of critical international importance as it supports scientific explorations and engineering. Software development in this area is...
Robert Palmer, Steve Barrus, Yu Yang, Ganesh Gopal...
SCN
2008
Springer
147views Communications» more  SCN 2008»
14 years 11 months ago
Privacy-preserving secure relative localization in vehicular networks
Relative location information helps build vehicle topology maps. Such maps provide location information of nearby vehicles to drivers. In building a vehicle topology, one must cons...
Lei Tang, Xiaoyan Hong, Phillip G. Bradford
NAS
2010
IEEE
14 years 9 months ago
A Probabilistic Routing Protocol for Heterogeneous Sensor Networks
The past five years witnessed a rapid development in wireless sensor networks, which have been widely used in military and civilian applications. Due to different requirements in t...
Yuefei Hu, Wenzhong Li, Xiao Chen, Xin Chen, Sangl...