2168 search results - page 430 / 434 » Randomized Algorithms and Complexity Theory |
90
Voted
RTA
2005
Springer
15 years 6 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
119
Voted
ACMICEC
2004
ACM
15 years 6 months ago
2004
ACM
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...
135
Voted
EMSOFT
2004
Springer
15 years 6 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
94
Voted
ATAL
2003
Springer
15 years 6 months ago
2003
Springer
In a large distributed system it is often infeasible or even impossible to perform diagnosis using a single model of the whole system. Instead, several spatially distributed local...
120
Voted
PODS
2010
ACM
15 years 6 months ago
2010
ACM
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...