327 search results - page 20 / 66 » Exploiting Problem Decomposition in Multi-objective Constrai... |
119
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
146
click to vote
DAC
2010
ACM
15 years 2 months ago
2010
ACM
Given the increasing complexity of multi-processor systems-onchip, a wide range of parameters must be tuned to find the best trade-offs in terms of the selected system figures of ...
135
click to vote
PPSN
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
125
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...
128
Voted
DAC
2005
ACM
15 years 4 months ago
2005
ACM
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...