2473 search results - page 324 / 495 » The Logic of Communication Graphs |
189
click to vote
IJCM
2002
15 years 6 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
186
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
162
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we tackle the problem of coordinating multiple decentralised agents with continuous state variables. Specifically we propose a hybrid approach, which combin...
153
click to vote
TIT
2010
15 years 1 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
207
click to vote
IUI
2011
ACM
14 years 9 months ago
2011
ACM
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...