242 search results - page 34 / 49 » Distributed algorithms with dynamical random transitions |
PODC
1990
ACM
15 years 3 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
105
click to vote
CN
2010
14 years 11 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
CP
2006
Springer
15 years 3 months ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
106
click to vote
SIGMETRICS
2003
ACM
15 years 5 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
118
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Detecting moving objects using stationary cameras is an important precursor to many activity recognition, object recognition and tracking algorithms. In this paper, three innovati...