1236 search results - page 5 / 248 » Prefix-Like Complexities and Computability in the Limit |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
We present a new arrangement of directory bits called the segment directory to improve directory storage efficiency: a segment directory can point to several sharing processors wi...
SAC
2005
ACM
14 years 28 days ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
IPPS
2005
IEEE
14 years 29 days ago
2005
IEEE
Due to the increasing complexity, the behavior of large-scale distributed systems becomes difficult to predict. The ability of on-line identification and autotuning of adaptive co...
ICN
2009
Springer
13 years 5 months ago
2009
Springer
It is essential that a monitoring system is being designed with performance and scalability in mind. But due to the diversity and complexity of both the monitoring and the monitore...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...