6105 search results - page 105 / 1221 » A Parallel Algorithm for Bound-Smoothing |
129
click to vote
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
106
click to vote
OOPSLA
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
107
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper explains why parallel implementation of matrix multiplication--a seemingly simple algorithm that can be expressed as one statement and three nested loops--is complex: P...
159
click to vote
HIPC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
134
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we address the physical parallelization of a very efficient genetic algorithm (GA) known as gradual distributed real-coded GA (GD-RCGA). This search model naturally...