完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Hsieh, Ming Yu | |
| dc.contributor.author | Shieh, Min-Zheng | |
| dc.contributor.author | Tsai, Shi-Chun | |
| dc.date.accessioned | 2009-06-02T06:39:15Z | |
| dc.date.accessioned | 2020-05-25T06:41:02Z | - |
| dc.date.available | 2009-06-02T06:39:15Z | |
| dc.date.available | 2020-05-25T06:41:02Z | - |
| dc.date.issued | 2006-10-16T06:02:23Z | |
| dc.date.submitted | 2004-12-15 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1619 | - |
| dc.description.abstract | We consider a variation of the well known coin changing problem: Suppose that we buy some merchandise priced at x dollars in a cur- rency with n kinds of coins valued at c1; c2; ¢ ¢ ¢ ; cn dollars. What is the fewest possible number of coins required to be exchanged? In this paper, we propose a greedy algorithm, which ¯nds optimal so- lutions for the case when ci = ci¡1; i = 1; :::; n. Also if we apply our greedy algorithm to general input, then we can determine the solution to be optimal or not in O(ncn) time. | |
| dc.description.sponsorship | 大同大學,台北市 | |
| dc.format.extent | 6p. | |
| dc.format.extent | 340350 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2004 ICS會議 | |
| dc.subject | Coin change | |
| dc.subject | coin exchange | |
| dc.subject | greedy algorithm | |
| dc.subject.other | Miscellaneous | |
| dc.title | A greedy approach to the coin exchange problem | |
| 分類: | 2004年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002004000214.pdf | 332.37 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。