194 search results - page 24 / 39 » Computing Roundness is Easy if the Set is Almost Round |
ICDCN
2011
Springer
12 years 11 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
PERCOM
2006
ACM
14 years 7 months ago
2006
ACM
We propose several localized sensor area coverage protocols, for arbitrary ratio of sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors...
LICS
2000
IEEE
13 years 12 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
TC
2011
13 years 2 months ago
2011
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
This work presents a new comparison-based diagnosis model and a new algorithm, called Hi-Dif, based on this model. The algorithm is used for checking the integrity of systems with...