270 search results - page 45 / 54 » Constraint relaxation in approximate linear programs |
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
ICALP
2003
Springer
14 years 18 days ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We present new insights into how to achieve higher frequencies in large-scale nonlinear predictive control using truncated-like schemes. The basic idea is that, instead of solving ...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (V...