84 search results - page 11 / 17 » A Parallel Distance-2 Graph Coloring Algorithm for Distribut... |
ICPP
2006
IEEE
14 years 23 days ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
ATAL
2006
Springer
13 years 10 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
DCOSS
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
EUROPAR
2007
Springer
14 years 26 days ago
2007
Springer
The performance of many scientific applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...