Sciweavers

91 search results - page 11 / 19
» Balanced allocations: the weighted case
Sort
View
MASCOTS
2007
13 years 11 months ago
Multiobjective Analysis in Wireless Mesh Networks
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
Cristiana Gomes, Gurvan Huiban
ICASSP
2011
IEEE
13 years 1 months ago
Quantization with an adjustable codeword length penalty
Quantizers are generally designed either for fixed-rate coding or variable-rate coding. Under common conditions, variable-rate quantization leads to the same mean distortion for ...
W. Bastiaan Kleijn, Moo Young Kim
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 11 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
WINE
2009
Springer
184views Economy» more  WINE 2009»
14 years 4 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
EWSN
2004
Springer
14 years 3 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...