10 search results - page 2 / 2 » Concave Programming Upper Bounds on the Capacity of 2-D Cons... |
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
GLVLSI
1996
IEEE
13 years 9 months ago
1996
IEEE
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...