777 search results - page 55 / 156 » A fast algorithm for the computation of an upper bound on th... |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
SIAMSC
2008
13 years 7 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
SPAA
1998
ACM
13 years 12 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...