17 search results - page 1 / 4 » Solving a 2D Knapsack Problem on an Associative Computer Aug... |
PDPTA
1996
13 years 6 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
MP
2002
13 years 4 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
CDC
2008
IEEE
13 years 6 months ago
2008
IEEE
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
RT
1998
Springer
13 years 9 months ago
1998
Springer
We describe an interactive system to reconstruct 3D geometry and extract textures from a set of photographs taken with arbitrary camera parameters. The basic idea is to let the use...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...