10072 search results - page 201 / 2015 » Composition of Model Programs |
171
Voted
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
148
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
This paper considers network services that bind identifiers in the course of delivering messages, and also persistent, point-to-point connections made in the context of such bindin...
196
Voted
ACS
2011
15 years 1 months ago
2011
We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in...
180
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
165
click to vote
CALCO
2009
Springer
16 years 1 months ago
2009
Springer
The microcosm principle, advocated by Baez and Dolan and formalized for Lawvere theories lately by three of the authors, has been applied to coalgebras in order to describe composi...