1594 search results - page 183 / 319 » An Algorithm to Compute Collusion Paths |
148
click to vote
PLDI
1998
ACM
15 years 7 months ago
1998
ACM
The fth release of the multithreaded language Cilk uses a provably good \work-stealing" scheduling algorithm similar to the rst system, but the language has been completely r...
163
Voted
EDBT
2012
ACM
13 years 6 months ago
2012
ACM
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
158
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
140
Voted
MIDDLEWARE
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. To disseminate messages from a single source to a large number of targeted receivers, a natural approach is the tree-based application layer multicast (ALM). However, in ...
106
Voted
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that ...