Sciweavers

7047 search results - page 71 / 1410
» Focusing on Binding and Computation
Sort
View
APN
2001
Springer
15 years 4 months ago
Optimising Enabling Tests and Unfoldings of Algebraic System Nets
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
Marko Mäkelä
ICDCS
1993
IEEE
15 years 4 months ago
Maintaining Information about Persistent Replicated Objects in a Distributed System
The paper presents a general model for persistent replicated object management and identifies what meta information about objects needs to be maintained by a naming and binding se...
Mark C. Little, Daniel L. McCue, Santosh K. Shriva...
ICFP
2003
ACM
15 years 12 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 1 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
BMCBI
2010
106views more  BMCBI 2010»
15 years 6 hour ago
Predicting MHC class I epitopes in large datasets
Background: Experimental screening of large sets of peptides with respect to their MHC binding capabilities is still very demanding due to the large number of possible peptide seq...
Kirsten Roomp, Iris Antes, Thomas Lengauer