327 search results - page 8 / 66 » Exploiting Problem Decomposition in Multi-objective Constrai... |
CVPR
2010
IEEE
14 years 3 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...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. T...
ICTAI
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
TSP
2011
13 years 2 months ago
2011
Abstract—We propose a sequential framework for the distributed multiple-sensor estimation and coding problem that decomposes the problem into a series of side-informed source cod...
IOR
2011
13 years 2 months ago
2011
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...