Sciweavers

39 search results - page 4 / 8
» On the Performance of Congestion Games for Optimum Satisfiab...
Sort
View
SPAA
2003
ACM
14 years 19 days ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
GLOBECOM
2007
IEEE
13 years 11 months ago
Joint Traffic Blocking and Routing Under Network Failures and Maintenances
Under device failures and maintenance activities, network resources reduce and congestion may arise inside networks. As a result, users experience degraded performance on packet d...
Chao Liang, Zihui Ge, Yong Liu
CORR
2008
Springer
81views Education» more  CORR 2008»
13 years 7 months ago
Universal Denoising of Discrete-time Continuous-Amplitude Signals
We consider the problem of reconstructing a discrete-time continuous-amplitude signal corrupted by a known memoryless channel with a general output alphabet. We develop a sequence ...
Kamakshi Sivaramakrishnan, Tsachy Weissman
ACMACE
2005
ACM
14 years 29 days ago
Achieving fairness in multiplayer network games through automated latency balancing
Over the past few years, the prominence of multiplayer network gaming has increased dramatically in the Internet. The effect of network delay (lag) on multiplayer network gaming h...
Sebastian Zander, Ian Leeder, Grenville J. Armitag...
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 15 days ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...