575 search results - page 18 / 115 » Computing Maximum Subsequence in Parallel |
IRREGULAR
1998
Springer
13 years 11 months ago
1998
Springer
To achieve scalable parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is ...
OPODIS
2010
13 years 5 months ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
Recent research in multi-site parallel job scheduling leverages user-provided estimates of job communication characteristics to effectively partition the job across multiple clus...
IPPS
2003
IEEE
14 years 25 days ago
2003
IEEE
Clusters and distributed systems offer fault tolerance and high performance through load sharing, and are thus attractive in real-time applications. When all computers are up and ...
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...