849 search results - page 30 / 170 » Network-Aware Distributed Computing: A Case Study |
103
click to vote
GC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
123
click to vote
IJCAI
1993
15 years 3 months ago
1993
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
126
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
128
Voted
PERCOM
2004
ACM
16 years 2 months ago
2004
ACM
Pervasive computing calls for suitable middleware and programming models to deal with large software systems dived in dynamic mobile network environments. Here we present the prog...
123
click to vote
DAGSTUHL
2004
15 years 3 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...