1434 search results - page 22 / 287 » Distributed Computing with Imperfect Randomness |
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
GRC
2008
IEEE
13 years 8 months ago
2008
IEEE
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
JACM
2006
13 years 7 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
PODS
2012
ACM
11 years 10 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...