Sciweavers

674 search results - page 14 / 135
» The computational complexity of the parallel knock-out probl...
Sort
View
ICDCS
2002
IEEE
14 years 10 days ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir
BMCBI
2010
175views more  BMCBI 2010»
13 years 7 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
ECRTS
2009
IEEE
13 years 5 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner
ICPP
2007
IEEE
14 years 1 months ago
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, Ch...
IPPS
2002
IEEE
14 years 10 days ago
Next Generation System Software for Future High-End Computing Systems
Future high-end computers will offer great performance improvements over today’s machines, enabling applications of far greater complexity. However, designers must solve the cha...
Guang R. Gao, Kevin B. Theobald, Ziang Hu, Haiping...