54 search results - page 9 / 11 » Approximability of Integer Programming with Generalised Cons... |
71
Voted
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—The problem of maximizing the sum of the transmit rates while limiting the outage probability below an appropriate threshold is investigated for networks where the nodes have li...
105
Voted
ORL
2006
14 years 9 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...