Sciweavers

630 search results - page 81 / 126
» Hardness results for approximating the bandwidth
Sort
View
MUE
2009
IEEE
252views Multimedia» more  MUE 2009»
16 years 27 days ago
DDoS Detection and Traceback with Decision Tree and Grey Relational Analysis
As modern life becomes increasingly closely bound to the Internet, network security becomes increasingly important. Like it or not, we all live under the shadow of network threats...
Yi-Chi Wu, Huei-Ru Tseng, Wuu Yang, Rong-Hong Jan
ISCC
2000
IEEE
156views Communications» more  ISCC 2000»
15 years 10 months ago
Inverse Multiplexing for ATM. Technical Operation, Applications and Performance Evaluation Study
-- In a WAN established infrastructure, one of the main problems ATM network planners and users face, when greater than T1/E1 bandwidth is required, is the high cost associated to ...
Marcos Postigo-Boix, Mónica Aguilar-Igartua...
NIPS
1996
15 years 7 months ago
Reinforcement Learning for Dynamic Channel Allocation in Cellular Telephone Systems
In cellular telephone systems, an important problem is to dynamically allocate the communication resource channels so as to maximize service in a stochastic caller environment. Th...
Satinder P. Singh, Dimitri P. Bertsekas
WCNC
2008
IEEE
16 years 16 days ago
Proportional Fair Scheduling: Analytical Insight under Rayleigh Fading Environment
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
Erwu Liu, Kin K. Leung
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 6 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...