9997 search results - page 329 / 2000 » The case for crowd computing |
176
click to vote
DEXA
1998
Springer
15 years 11 months ago
1998
Springer
We discuss and prove the correctness of a transaction model for mobile computing. In our transaction model, we incorporate a prewrite operation (before a write) which does not upda...
154
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
184
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
163
click to vote
DAGSTUHL
2000
15 years 8 months ago
2000
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...
169
click to vote
SIROCCO
2000
15 years 8 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...