Sciweavers

543 search results - page 45 / 109
» New Upper Bounds for MaxSat
Sort
View
TIT
2008
94views more  TIT 2008»
14 years 9 months ago
Why Do Block Length and Delay Behave Differently if Feedback Is Present?
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
Anant Sahai
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
INFOCOM
2008
IEEE
15 years 4 months ago
Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...
Gianluca Rizzo, Jean-Yves Le Boudec
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 3 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
FOCS
2006
IEEE
15 years 3 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor