1119 search results - page 195 / 224 » Computing in the Presence of Timing Failures |
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
DCOSS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We develop a practical, distributed algorithm to detect events, identify measurement errors, and infer missing readings in ecological applications of wireless sensor netw...
WMCSA
2003
IEEE
14 years 25 days ago
2003
IEEE
1 In this work we consider the mobility of personal online identifiers. People change the identifiers through which they are reachable on-line as they change jobs or residences ...
TON
2002
13 years 7 months ago
2002
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
WINET
2010
13 years 5 months ago
2010
One way to reduce energy consumption in wireless sensor networks is to reduce the number of packets being transmitted in the network. As sensor networks are usually deployed with a...