Sciweavers

833 search results - page 82 / 167
» Simpler and better approximation algorithms for network desi...
Sort
View
ATAL
2003
Springer
14 years 1 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
ICNP
2009
IEEE
13 years 5 months ago
Achieving Efficiency and Fairness for Association Control in Vehicular Networks
Deploying city-wide 802.11 access points has made possible internet access in a vehicle, nevertheless it is challenging to maintain client performance at vehicular speed especially...
Lei Xie, Qun Li, Weizhen Mao, Jie Wu, Daoxu Chen
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
13 years 12 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
IFIP
2004
Springer
14 years 1 months ago
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Hu Zhang
COMPUTING
2010
13 years 5 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem