6105 search results - page 266 / 1221 » A Parallel Algorithm for Bound-Smoothing |
160
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...
164
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
158
click to vote
IVC
2006
15 years 6 months ago
2006
The Multi-Sector Algorithm (MSA) is a simplification of the CORDIC algorithm to more closely meet the requirements for a real-time general Hough transform applications. The MSA ca...
167
click to vote
IPPS
2007
IEEE
16 years 29 days ago
2007
IEEE
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...