219 search results - page 29 / 44 » Solving Semi-infinite Linear Programs Using Boosting-Like Me... |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Decoupling capacitors (decaps) are typically used to reduce the noise in the power supply network. Because the delay of gates and interconnects is affected by the supply voltag...
ISCA
2002
IEEE
13 years 7 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
GLOBECOM
2008
IEEE
14 years 2 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 ...