671 search results - page 51 / 135 » The Role of Composition in Computer Programming |
COORDINATION
2007
Springer
14 years 3 months ago
2007
Springer
Our aim is to define the kernel of a simple and uniform programming model—the reactor model—suitable for building and evolving internet-scale programs. A reactor consists of t...
AMAI
2006
Springer
13 years 9 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
TCS
2010
13 years 7 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
ICAC
2005
IEEE
14 years 2 months ago
2005
IEEE
Track 2 - Modeling and Abstraction of Services Process Session Chair: Dynamic Service Invocation Control in Service Composition Environments (SCC2010-2004) ...........................
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...