4759 search results - page 52 / 952 » Parallelizing the Phylogeny Problem |
ICPP
2008
IEEE
14 years 2 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
IPPS
2000
IEEE
14 years 7 days ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
PDP
2009
IEEE
14 years 2 months ago
2009
IEEE
—Multicore machines are becoming common. There are many languages, language extensions and libraries devoted to improve the programmability and performance of these machines. In ...
IPPS
1999
IEEE
14 years 3 days ago
1999
IEEE
Genetic Algorithms (GAs) have been known to be robust for search and optimization problems. Image registration can take advantage of the robustness of GAs in finding best transform...