AN OPTIMAL PARALLEL ALGORITHM FOR GENERATING PERMUTATIONS IN MINIMAL CHANGE ORDER

doi:10.1016/S0167-8191(06)80018-9

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	TSAY, JC	en_US
dc.contributor.author	LEE, WP	en_US
dc.date.accessioned	2019-04-02T05:59:22Z	-
dc.date.available	2019-04-02T05:59:22Z	-
dc.date.issued	1994-03-01	en_US
dc.identifier.issn	0167-8191	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0167-8191(06)80018-9	en_US
dc.identifier.uri	http://hdl.handle.net/11536/149114	-
dc.description.abstract	Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processors. Because of the simplicity and regularity of the processors, the model is very suitable for VLSI implementation. Another advantageous characteristic of this design is that it can generate all the permutations in minimal change order.	en_US
dc.language.iso	en_US	en_US
dc.subject	MINIMAL CHANGE ORDER	en_US
dc.subject	PARALLEL ALGORITHM	en_US
dc.subject	PERMUTATION GENERATION	en_US
dc.subject	VLSI	en_US
dc.title	AN OPTIMAL PARALLEL ALGORITHM FOR GENERATING PERMUTATIONS IN MINIMAL CHANGE ORDER	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0167-8191(06)80018-9	en_US
dc.identifier.journal	PARALLEL COMPUTING	en_US
dc.citation.volume	20	en_US
dc.citation.spage	353	en_US
dc.citation.epage	361	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1994NC86800006	en_US
dc.citation.woscount	2	en_US
顯示於類別：	期刊論文