A SYSTOLIC ALGORITHM FOR SOLVING KNAPSACK-PROBLEMS

Full metadata record

DC Field	Value	Language
dc.contributor.author	LIN, CJ	en_US
dc.contributor.author	CHEN, SJ	en_US
dc.date.accessioned	2014-12-08T15:04:12Z	-
dc.date.available	2014-12-08T15:04:12Z	-
dc.date.issued	1994	en_US
dc.identifier.issn	0020-7160	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2703	-
dc.identifier.uri	http://dx.doi.org/10.1080/00207169408804335	en_US
dc.description.abstract	A systolic algorithm for solving the O/1-knapsack problems with n items is presented. The computational model used is a tree structure which consists of 2(n) identical processing elements (PEs). Each PE executes the same program at any time step. The time complexity varies from n to 3n - 2 steps which includes all the input/output data communication time. The design process and the correctness verification of this algorithm are considered in detail.	en_US
dc.language.iso	en_US	en_US
dc.subject	SYSTOLIC ARRAY	en_US
dc.subject	PARALLEL ALGORITHM	en_US
dc.subject	TREE	en_US
dc.subject	KNAPSACK PROBLEM	en_US
dc.title	A SYSTOLIC ALGORITHM FOR SOLVING KNAPSACK-PROBLEMS	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1080/00207169408804335	en_US
dc.identifier.journal	INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS	en_US
dc.citation.volume	54	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	23	en_US
dc.citation.epage	32	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:A1994QV10200003	-
dc.citation.woscount	0	-
Appears in Collections:	Articles