370 search results - page 5 / 74 » The perfectly synchronized round-based model of distributed ... |
COORDINATION
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
CANS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper we study Perfectly Secure Message Transmission (PSMT) between a sender S and a receiver R, connected in a directed synchronous network through multiple para...
171
click to vote
SPAA
2012
ACM
13 years 21 hour ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...