9325 search results - page 220 / 1865 » The decentralized implementability problem |
111
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
124
click to vote
DCC
2002
IEEE
16 years 2 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
116
Voted
SAC
1997
ACM
15 years 7 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
129
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
146
click to vote
SIAMSC
2010
15 years 1 months ago
2010
In this paper, we study alternating direction methods for solving constrained total-variation image restoration and reconstruction problems. Alternating direction methods can be im...