400 search results - page 43 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
GECCO
2008
Springer
15 years 27 days ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
124
click to vote
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
ICMCS
2009
IEEE
14 years 9 months ago
2009
IEEE
Parallel scalability allows an application to efficiently utilize an increasing number of processing elements. In this paper we explore a design space for parallel scalability for...
103
click to vote
ICPP
2008
IEEE
15 years 6 months ago
2008
IEEE
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
115
click to vote
ESA
2004
Springer
15 years 5 months ago
2004
Springer
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...