6105 search results - page 97 / 1221 » A Parallel Algorithm for Bound-Smoothing |
130
click to vote
NC
1998
15 years 2 months ago
1998
In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
112
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
This paper presents an architecture which is suitable for a massive parallelization of the compact genetic algorithm. The approach is scalable, has low synchronization costs, and i...
112
click to vote
SRDS
1998
IEEE
15 years 5 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
124
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
119
click to vote
SWAT
1992
Springer
15 years 5 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...