THE TOWERS OF HANOI PROBLEM WITH PARALLEL MOVES

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	WU, JS	en_US
dc.contributor.author	CHEN, RJ	en_US
dc.date.accessioned	2014-12-08T15:04:42Z	-
dc.date.available	2014-12-08T15:04:42Z	-
dc.date.issued	1992-12-21	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/0020-0190(92)90207-C	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3204	-
dc.description.abstract	This paper proposes a variant of the towers of Hanoi problem allowing parallel moves. An algorithm for this problem is presented and proved to be optimal.	en_US
dc.language.iso	en_US	en_US
dc.subject	TOWERS OF HANOI	en_US
dc.subject	RECURRENCE RELATIONS	en_US
dc.subject	ALGORITHMS	en_US
dc.title	THE TOWERS OF HANOI PROBLEM WITH PARALLEL MOVES	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/0020-0190(92)90207-C	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	44	en_US
dc.citation.issue	5	en_US
dc.citation.spage	241	en_US
dc.citation.epage	243	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1992KH45200002	-
dc.citation.woscount	10	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。