583 search results - page 22 / 117 » New algorithms for efficient parallel string comparison |
TCS
2008
14 years 11 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
109
click to vote
BMCBI
2008
14 years 12 months ago
2008
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in or...
104
click to vote
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
To support incremental replay of message-passing applications, processes must periodically checkpoint and the content of some messages must be logged, to break dependencies of the...
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...