16596 search results - page 414 / 3320 » Generalized Assignment Problems |
207
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
216
click to vote
TWC
2010
15 years 2 months ago
2010
We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sugge...
221
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
187
click to vote
CODES
2005
IEEE
16 years 1 months ago
2005
IEEE
Networks-on-Chip (NoCs) have been recently proposed as a promising solution to complex on-chip communication problems. The lack of an unified representation of applications and ar...
211
click to vote
FSTTCS
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...