948 search results - page 91 / 190 » What can we achieve by arbitrary announcements |
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Routing to mobile nodes in a wireless network is conventionally performed by associating a static IP address (or a geographic location) to each node, and routing to that address...
ASPDAC
2009
ACM
14 years 3 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
IPSN
2007
Springer
14 years 3 months ago
2007
Springer
Target detection and field surveillance are among the most prominent applications of Sensor Networks (SN). The quality of detection achieved by a SN can be quantified by evaluat...
SIGECOM
2004
ACM
14 years 2 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
CSL
2004
Springer
14 years 2 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...