2957 search results - page 521 / 592 » The Complexity of Polynomial-Time Approximation |
115
Voted
TON
1998
15 years 3 months ago
1998
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
143
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
129
click to vote
PE
2007
Springer
15 years 2 months ago
2007
Springer
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the “strict” and “approximate” ins...
139
Voted
TIP
2008
15 years 2 months ago
2008
In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. Three methods for sp...
121
Voted
ATMOS
2010
15 years 2 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...