10901 search results - page 1820 / 2181 » Approximations in Distributed Optimization |
151
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
141
click to vote
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
192
click to vote
SAC
2000
ACM
15 years 9 months ago
2000
ACM
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
154
click to vote
VRML
2000
ACM
15 years 9 months ago
2000
ACM
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
138
click to vote
ICS
1998
Tsinghua U.
15 years 9 months ago
1998
Tsinghua U.
In this paper we propose and evaluate the Adaptive++ technique, a novel runtime-only data prefetching strategy for software-based distributed shared-memory systems (software DSMs)...