1173 search results - page 22 / 235 » On the Compositionality of Round Abstraction |
171
click to vote
ERSHOV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The article concerns problems of formulating standard requirements to implementations of mathematical functions working with floating-point numbers and conformance test ...
157
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
189
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
174
click to vote
EEE
2005
IEEE
16 years 9 days ago
2005
IEEE
For the composition of Web services non-functional characteristics are commonly considered criteria for finding and selecting available services. Our work focuses on a mechanism ...
162
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. To direct automated Web service composition, it is compelling to provide a template, workflow or scaffolding that dictates the ways in which services can be composed. I...