10718 search results - page 356 / 2144 » On the Circuit Implementation Problem |
533
click to vote
DAC
2012
ACM
13 years 9 months ago
2012
ACM
We develop a projected-subgradient primal-dual Lagrange optimization for global placement, that can be instantiated with a variety of interconnect models. It decomposes the origin...
181
click to vote
MATES
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Cooperative problem solving without communication is an oftenstudied field within multi-agent research. Realistic problems investigated in this particular field are compl...
181
click to vote
DCC
2002
IEEE
16 years 6 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 (...
165
click to vote
SAC
1997
ACM
15 years 11 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...
190
click to vote
APPROX
2008
Springer
15 years 8 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...