Sciweavers

3374 search results - page 656 / 675
» Explaining Similarity of Terms
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
LISP
2007
74views more  LISP 2007»
13 years 7 months ago
Improving the lazy Krivine machine
Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pu...
Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. S...
BMCBI
2004
265views more  BMCBI 2004»
13 years 7 months ago
ASAView: Database and tool for solvent accessibility representation in proteins
Background: Accessible surface area (ASA) or solvent accessibility of amino acids in a protein has important implications. Knowledge of surface residues helps in locating potentia...
Shandar Ahmad, M. Michael Gromiha, Hamed Fawareh, ...
CMOT
2004
83views more  CMOT 2004»
13 years 7 months ago
Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings
Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social netwo...
Douglas R. White, Jason Owen-Smith, James Moody, W...
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard