5171 search results - page 430 / 1035 » Deterministic Parallel Processing |
133
Voted
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
178
click to vote
EUROCAST
1997
Springer
15 years 8 months ago
1997
Springer
The ability to detect object size, location and movement is essential for a visual system in either a biological or man made environment. In this paper we present a model for esti...
133
click to vote
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
139
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
148
click to vote
FUIN
2007
15 years 4 months ago
2007
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...