完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Huang, Tetz C. | |
| dc.contributor.author | Lin, Ji-Cheng | |
| dc.contributor.author | Chen, Hsueh-Jen | |
| dc.date.accessioned | 2009-08-23T04:40:07Z | |
| dc.date.accessioned | 2020-05-25T06:24:02Z | - |
| dc.date.available | 2009-08-23T04:40:07Z | |
| dc.date.available | 2020-05-25T06:24:02Z | - |
| dc.date.issued | 2006-10-18T01:43:46Z | |
| dc.date.submitted | 1998-12-17 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1800 | - |
| dc.description.abstract | In this paper,we design a self-stabilizing algorithm which finds a 2-center for a distributed system with a tree topology. Our algorithm is based on the algorithm in [14,15].The latter algorithm enables us to find the center(or centers)for the tree. If we sever the tree at the center(or centers),we obtain two subtrees. One of the major works in this paper is to show that if we pick a center from each subtree, the two picked centers will constitute a 2-center for the original tree. With this in mind, we design our algorithm, so that it is equipped with the ability of "sensing" the two subtrees and then finding out a center in each of them | |
| dc.description.sponsorship | 成功大學,台南市 | |
| dc.format.extent | 6p. | |
| dc.format.extent | 408659 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 1998 ICS會議 | |
| dc.subject | distributed systems | |
| dc.subject | self-stabilizing algorithms | |
| dc.subject | cneters | |
| dc.subject | 2-centers | |
| dc.subject | trees | |
| dc.subject.other | Miscellaneous Algorithms | |
| dc.title | A application of karaata's self-stabilizing center-finding algorithm | |
| 分類: | 1998年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics001998000038.pdf | 399.08 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。