2924 search results - page 530 / 585 » Lower Bounds in Distributed Computing |
SP
2000
IEEE
14 years 1 months ago
2000
IEEE
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
EDCC
1999
Springer
14 years 1 months ago
1999
Springer
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...
SUTC
2010
IEEE
14 years 26 days ago
2010
IEEE
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...
DSN
2006
IEEE
14 years 19 days ago
2006
IEEE
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
CIMAGING
2010
13 years 10 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...