2084 search results - page 71 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
IACR
2011
13 years 9 months ago
2011
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
DCOSS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
WOWMOM
2005
ACM
15 years 3 months ago
2005
ACM
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...