7133 search results - page 1024 / 1427 » Communication algorithms with advice |
187
click to vote
AMC
2005
15 years 7 months ago
2005
In this paper, we study graphs that arise from certain sensory and communication limitations on the local interactions in multi-agent systems. In particular, we show that the set ...
199
click to vote
TCS
2008
15 years 7 months ago
2008
Subtyping relations for the -calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to d...
229
click to vote
TPDS
2008
15 years 7 months ago
2008
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
192
click to vote
JGAA
2000
15 years 7 months ago
2000
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
207
click to vote
ETT
2002
15 years 7 months ago
2002
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) probabilities in queueing networks using importance sampling. Unlike previously pr...