Sciweavers

148 search results - page 12 / 30
» DisNet: A Framework for Distributed Graph Computation
Sort
View
AAAI
2007
15 years 2 months ago
Allocating Goods on a Graph to Eliminate Envy
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...
Yann Chevaleyre, Ulrich Endriss, Nicolas Maudet
IPPS
2005
IEEE
15 years 5 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
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...
Soumya Sanyal, Sajal K. Das
IPPS
2008
IEEE
15 years 6 months ago
Parallel mining of closed quasi-cliques
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...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
IPPS
2007
IEEE
15 years 6 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
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...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
MOBICOM
2012
ACM
13 years 2 months ago
Temporal reachability graphs
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...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...