575 search results - page 62 / 115 » Computing Maximum Subsequence in Parallel |
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
CIA
2006
Springer
14 years 17 days ago
2006
Springer
We present a hybrid algorithm for distributed task allocation problem in a cooperative logistics domain. Our approach aims to achieve superior computational performance by combinin...
TPDS
1998
13 years 8 months ago
1998
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
BMCBI
2008
13 years 9 months ago
2008
Background: Genetic association studies have been used to map disease-causing genes. A newly introduced statistical method, called exhaustive haplotype association study, analyzes...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...