Sciweavers

913 search results - page 123 / 183
» Full Abstraction for Linda
Sort
View
LISP
2006
105views more  LISP 2006»
13 years 9 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
FUIN
2007
95views more  FUIN 2007»
13 years 9 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
SIAMAM
2008
94views more  SIAMAM 2008»
13 years 9 months ago
Diffusion of Protein Receptors on a Cylindrical Dendritic Membrane with Partially Absorbing Traps
Abstract. We present a model of protein receptor trafficking within the membrane of a cylindrical dendrite containing small protrusions called spines. Spines are the locus of most ...
Paul C. Bressloff, Berton A. Earnshaw, Michael J. ...
RTS
2006
96views more  RTS 2006»
13 years 8 months ago
The TTA's Approach to Resilience after Transient Upsets
Abstract. The Time-Triggered Architecture, as architecture for safety-critical realtime applications, incorporates fault-tolerance mechanisms to ensure correct system operation des...
Wilfried Steiner, Michael Paulitsch, Hermann Kopet...
AMAI
2005
Springer
13 years 8 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter