102291 search results - page 19878 / 20459 » Computing |
185
click to vote
POPL
1989
ACM
15 years 8 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
121
Voted
VLDB
1989
ACM
15 years 8 months ago
1989
ACM
In this paper. we utilize intervals for unknown values in incompleterelational databases.We usetablesto representunknown relations. First, we define three partial tuple types in a...
127
Voted
WDAG
1989
Springer
15 years 8 months ago
1989
Springer
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
200
click to vote
COBUILD
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. As the amount of information and communication increases dramatically new working environments must provide efficient mechanisms to maximize the benefits of these develop...
128
click to vote
WDAG
1990
Springer
15 years 8 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...