6105 search results - page 195 / 1221 » A Parallel Algorithm for Bound-Smoothing |
160
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
184
click to vote
JASIS
2007
15 years 6 months ago
2007
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
178
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
170
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Trends in parallel computing indicate that heterogeneous parallel computing will be one of the most widespread platforms for computation-intensive applications. A heterogeneous com...
139
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we present an evaluation of selected parallel strategies for Simulated Annealing and Simulated Evolution, identifying the impact of various issues on the effectivene...