Sciweavers

2110 search results - page 11 / 422
» What is the complexity of a distributed computing system
Sort
View
EDOC
2006
IEEE
14 years 1 months ago
What Applying of the ODP Viewpoints Teaches Us about Tool-Chains
For some time, we have focused our research on the generic B2B middleware services for managing interenterprise communities of autonomous business services. In contrast to some ea...
Lea Kutvonen
CHIMIT
2007
ACM
13 years 11 months ago
Supporting expertise awareness: finding out what others know
This paper presents an innovative approach to solve the problem of missing transparency of competencies within virtual organizations. We based our work on empirical studies to cop...
Christian Dörner, Volkmar Pipek, Markus Won
APSCC
2009
IEEE
14 years 2 months ago
SADI Semantic Web Services -- 'cause you can't always GET what you want!
SADI – Semantic Automated Discovery and Integration – is a set of standards-compliant Semantic Web Service design patterns that exploit the relatively straightforward interfac...
Mark D. Wilkinson, Benjamin P. Vandervalk, E. Luke...
CADE
1992
Springer
13 years 11 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
IJAR
2006
125views more  IJAR 2006»
13 years 7 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson