Sciweavers

906 search results - page 78 / 182
» Linking Theories of Concurrency
Sort
View
NIPS
2003
14 years 11 months ago
A Biologically Plausible Algorithm for Reinforcement-shaped Representational Learning
Significant plasticity in sensory cortical representations can be driven in mature animals either by behavioural tasks that pair sensory stimuli with reinforcement, or by electro...
Maneesh Sahani
SIROCCO
1998
14 years 11 months ago
The counting pyramid: an adaptive distributed counting scheme
A distributed counter is a concurrent object which provides a fetch-and-increment operation on a shared value. On the basis of a distributed counter, one can implement various fun...
Roger Wattenhofer, Peter Widmayer
ROOM
2000
14 years 11 months ago
An Overview of The Mensurae Language: Specifying Business Processes
We describe a language which can be used to model business processes (both technical and nontechnical). It has a formal semantics, so as to enable formal analysis and prediction o...
T. S. E. Maibaum
GG
2008
Springer
14 years 11 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
APAL
2008
80views more  APAL 2008»
14 years 10 months ago
System BV is NP-complete
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a self-dual, non-commutative logical operator, called seq. While the rules mix ...
Ozan Kahramanogullari