Sciweavers

3082 search results - page 83 / 617
» New Bounds for the Controller Problem
Sort
View
TIT
2011
119views more  TIT 2011»
14 years 11 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
16 years 1 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 4 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ATAL
2006
Springer
15 years 7 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
INFOCOM
2005
IEEE
15 years 9 months ago
The impact of imperfect scheduling on cross-layer rate control in wireless networks
— In this paper, we study cross-layer design for rate control in multihop wireless networks. In our previous work, we have developed an optimal cross-layered rate control scheme ...
Xiaojun Lin, Ness B. Shroff