Sciweavers

88 search results - page 10 / 18
» Complexity of Data Dependence problems for Program Schemas w...
Sort
View
BMCBI
2007
102views more  BMCBI 2007»
15 years 3 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
134
Voted
CLOUDCOM
2010
Springer
15 years 1 months ago
Using Global Behavior Modeling to Improve QoS in Cloud Data Storage Services
Abstract--The cloud computing model aims to make largescale data-intensive computing affordable even for users with limited financial resources, that cannot invest into expensive i...
Jesús Montes, Bogdan Nicolae, Gabriel Anton...
PLDI
2011
ACM
14 years 6 months ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
SC
2000
ACM
15 years 7 months ago
Dynamic Software Testing of MPI Applications with Umpire
As evidenced by the popularity of MPI (Message Passing Interface), message passing is an effective programming technique for managing coarse-grained concurrency on distributed com...
Jeffrey S. Vetter, Bronis R. de Supinski
POPL
2003
ACM
16 years 3 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper