275 search results - page 7 / 55 » A Markovian Concurrency Measure |
ASIACRYPT
2001
Springer
15 years 2 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
SENSYS
2006
ACM
15 years 3 months ago
2006
ACM
We undertake a systematic experimental study of the effects of concurrent packet transmissions in low-power wireless networks. Our measurements, conducted with Mica2 motes equippe...
ISRR
2001
Springer
15 years 2 months ago
2001
Springer
One of the most challenging aspects of concurrent mapping and localization (CML) is the problem of data association. Because of uncertainty in the origins of sensor measurements, i...
ASP
2001
Springer
15 years 1 months ago
2001
Springer
We propose a situation calculus formalization of action domains that include numeric-valued fluents (so-called additive or measure fluents) and concurrency. Our approach allows fo...
MOBISYS
2008
ACM
15 years 9 months ago
2008
ACM
Using 802.11 concurrently for communications and positioning is problematic, especially if location-based services (e.g., indoor navigation) are concurrently executed with real-ti...