6105 search results - page 210 / 1221 » A Parallel Algorithm for Bound-Smoothing |
174
click to vote
ICPP
1994
IEEE
15 years 10 months ago
1994
IEEE
1 In this paper, we explore the problem of scheduling parallel programs using task duplication for messagepassing multicomputers. Task duplication means scheduling a parallel progr...
172
click to vote
WOB
2003
15 years 7 months ago
2003
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
278
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
177
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Classification is a key problem in machine learning/data mining. Algorithms for classification have the ability to predict the class of a new instance after having been trained on...
164
click to vote
JUCS
2008
15 years 6 months ago
2008
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...