6105 search results - page 118 / 1221 » A Parallel Algorithm for Bound-Smoothing |
117
click to vote
ICANNGA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
118
Voted
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
184
click to vote
ICPP
2000
IEEE
15 years 9 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
119
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers sever...
125
click to vote
CLUSTER
2007
IEEE
15 years 11 months ago
2007
IEEE
— Data mining in biological structure libraries can be a powerful tool to better understand biochemical processes. This article introduces the LISA algorithm which enables the re...