148 search results - page 12 / 30 » DisNet: A Framework for Distributed Graph Computation |
120
click to vote
AAAI
2007
15 years 4 months ago
2007
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
117
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
137
Voted
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
105
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
143
Voted
MOBICOM
2012
ACM
13 years 5 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...