Sciweavers

23 search results - page 1 / 5
» A branch-and-cut approach for minimum cost multi-level netwo...
Sort
View
DM
2002
100views more  DM 2002»
13 years 4 months ago
A branch-and-cut approach for minimum cost multi-level network design
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on...
Sunil Chopra, Chih-Yang Tsai
TON
2010
279views more  TON 2010»
13 years 3 months ago
Distributed algorithms for minimum cost multicast with network coding
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...
Yufang Xi, Edmund M. Yeh
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 8 months ago
Fast Analytic Placement using Minimum Cost Flow
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
Ameya R. Agnihotri, Patrick H. Madden
ICC
2009
IEEE
121views Communications» more  ICC 2009»
13 years 2 months ago
Designing Demand-Wise Shared Protection Networks with Specified Minimum Dual-Failure Restorability
-- We develop a new integer linear programming model to optimally design demand-wise shared protection (DSP) networks to achieve specified minimum levels of dual-failure restorabil...
Jude Akpuh, John Doucette
ATAL
2003
Springer
13 years 10 months ago
Minimizing communication cost in a distributed Bayesian network using a decentralized MDP
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
Jiaying Shen, Victor R. Lesser, Norman Carver