16596 search results - page 382 / 3320 » Generalized Assignment Problems |
236
click to vote
COR
2011
15 years 2 months ago
2011
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
223
click to vote
CVPR
2012
IEEE
13 years 10 months ago
2012
IEEE
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
224
click to vote
ESA
2007
Springer
16 years 1 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
237
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
201
click to vote
CCS
2006
ACM
15 years 11 months ago
2006
ACM
The usage control (UCON) model was introduced as a unified approach to capture a number of extensions for traditional access control models. While the policy specification flexibi...