1179 search results - page 39 / 236 » Modeling Time in Computing: A Taxonomy and a Comparative Sur... |
186
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: High-throughput peptide and protein identification technologies have benefited tremendously from strategies based on tandem mass spectrometry (MS/MS) in combination wi...
141
Voted
WSC
2004
15 years 7 months ago
2004
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
143
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
276
click to vote
CSC
2010
15 years 1 months ago
2010
- We have developed a performance prediction model for non-bonded interaction computations in molecular dynamics simulations, thereby predicting the optimal cell dimension in a lin...
158
click to vote
RECOMB
2009
Springer
16 years 6 months ago
2009
Springer
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...