Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

PDPTA
1996

favoriteEmaildiscussreport

197views Distributed And Parallel Com...» more PDPTA 1996»

Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network

13 years 5 months ago

Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network

Download www.cs.kent.edu

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 into a knapsack of size L W and are only obtainable with guillotine-type side to side cuts. The parallel algorithm is described and analyzed for the associative model. The associative model ASC for parallel computation supports a generalized version of an associative style of computing that

Darrell R. Ulm, Johnnie W. Baker

Real-time Traffic

Associative Model | Associative Model Asc | Knapsack Problem | PDPTA 1996 | PDPTA 2007 |

claim paper

Related Content

» Extending Dantzigs bound to the bounded multipleclass binary Knapsack problem

» A fast algorithm to compute the controllability decentralized fixedmode and minimumphase r...

» Interactively Modeling with Photogrammetry

» Joint Power Control and Link Scheduling in Wireless Networks for Throughput Optimization

» Basis Pursuit in sensor networks

» Optimal Placement and Selection of Camera Network Nodes for Target Localization

» Localization and routing in sensor networks by local angle information

» Optimal relay assignment for cooperative communications

» Broadcasting on large scale heterogeneous platforms under the bounded multiport model

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1996
Where	PDPTA
Authors	Darrell R. Ulm, Johnnie W. Baker

Comments (0)