1429 search results - page 11 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
INFOCOM
1998
IEEE
1998
IEEE
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
13 years 11 months ago
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
PCM
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Due to its great ability of conquering clutters, which is especially useful for high-dimensional tracking problems, particle filter becomes popular in the visual trackin...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...
CC
2006
Springer
13 years 7 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
ICTCS
2005
Springer
14 years 29 days ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...