21007 search results - page 3706 / 4202 » Mobile Parallel Computing |
199
click to vote
SPAA
2003
ACM
16 years 27 days ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
230
click to vote
SPAA
2003
ACM
16 years 27 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
206
Voted
SPAA
2003
ACM
16 years 27 days ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
206
Voted
SPAA
2003
ACM
16 years 27 days ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
218
Voted
SPAA
2003
ACM
16 years 27 days 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...