5606 search results - page 213 / 1122 » Randomization Techniques for Graphs. |
100
click to vote
ACMSE
2005
ACM
15 years 6 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
109
click to vote
EVOW
2004
Springer
15 years 6 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
95
Voted
TSP
2008
15 years 20 days ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
117
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
EUROPAR
2009
Springer
15 years 5 months ago
2009
Springer
A high-level understanding of how an application executes and which performance characteristics it exhibits is essential in many areas of high performance computing, such as applic...