3367 search results - page 394 / 674 » Incremental assignment problem |
116
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...
130
click to vote
PAMI
2006
15 years 4 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
109
click to vote
INFORMATICALT
2007
15 years 4 months ago
2007
This paper is concerned with an employee scheduling problem involving multiple shifts and work centers, where employees belong to a hierarchy of categories having downward substitu...
110
click to vote
CAD
2002
Springer
15 years 4 months ago
2002
Springer
This paper discusses product variety design under optimization viewpoint. Product variety design means the challenge to simultaneously design multiple products toward higher optim...
135
click to vote
MST
2010
15 years 3 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...