Sciweavers

4432 search results - page 389 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 11 months ago
MDS Array Codes with Optimal Rebuilding
—MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fr...
Itzhak Tamo, Zhiying Wang, Jehoshua Bruck
ICALP
2009
Springer
16 years 5 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
INFOCOM
2009
IEEE
15 years 11 months ago
Multi-VPN Optimization for Scalable Routing via Relaying
—Enterprise networks are increasingly adopting Layer 3 Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) technology to connect geographically disparate locations...
MohammadHossein Bateni, Alexandre Gerber, Mohammad...
GLOBECOM
2007
IEEE
15 years 11 months ago
Distributed Maximum Lifetime Routing in Wireless Sensor Networks Based on Regularization
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
Vahid Shah-Mansouri, Vincent W. S. Wong
CP
2010
Springer
15 years 3 months ago
Checking-Up on Branch-and-Check
Abstract. Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasi...
J. Christopher Beck