28888 search results - page 5509 / 5778 » Computability and complexity in analysis |
177
click to vote
SPAA
1996
ACM
15 years 8 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
128
click to vote
PDIS
1993
IEEE
15 years 8 months ago
1993
IEEE
d Abstract:: ACM SIGMOD Record 22 (4), Dec. 1993) RM93 Rahm, E., Marek, R.: Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems. Proc 19th VL...
126
click to vote
PDIS
1993
IEEE
15 years 8 months ago
1993
IEEE
semantic knowledge all concurrent partitionedAbstract updates to an object must be treated as conflicting, andOptimistic replication is an important technique for merged manually b...
177
click to vote
PODC
1994
ACM
15 years 8 months ago
1994
ACM
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
164
click to vote
STACS
1992
Springer
15 years 8 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...