514 search results - page 51 / 103 » On enumerating all minimal solutions of feedback problems |
109
click to vote
AUTOMATICA
2008
15 years 24 days ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
128
Voted
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
72
Voted
ICASSP
2008
IEEE
15 years 7 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...
117
click to vote
CSI
2006
15 years 21 days ago
2006
In a distributed system, a number of application tasks may need to be assigned to different processors such that the system cost is minimized and the constraints with limited reso...
105
Voted
TIP
2008
15 years 17 days ago
2008
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. Th...