Sciweavers

1185 search results - page 69 / 237
» An Improved Parallel Thinning Algorithm
Sort
View
IJAIT
2007
119views more  IJAIT 2007»
14 years 9 months ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
15 years 4 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
DATE
2007
IEEE
134views Hardware» more  DATE 2007»
15 years 4 months ago
Non-fractional parallelism in LDPC decoder implementations
Because of its excellent bit-error-rate performance, the Low-Density Parity-Check (LDPC) decoding algorithm is gaining increased attention in communication standards and literatur...
John Dielissen, Andries Hekstra
SIGIR
2011
ACM
14 years 18 days ago
Parallel learning to rank for information retrieval
Learning to rank represents a category of effective ranking methods for information retrieval. While the primary concern of existing research has been accuracy, learning efficien...
Shuaiqiang Wang, Byron J. Gao, Ke Wang, Hady Wiraw...
TPDS
2002
136views more  TPDS 2002»
14 years 9 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert