完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | WONG, YC | en_US |
dc.contributor.author | HWANG, SY | en_US |
dc.date.accessioned | 2014-12-08T15:04:28Z | - |
dc.date.available | 2014-12-08T15:04:28Z | - |
dc.date.issued | 1993-07-01 | en_US |
dc.identifier.issn | 0167-8191 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/2968 | - |
dc.description.abstract | Manipulating uncertain information is a necessary capability for any intelligent system. Several approaches, such as the Bayesian theory, Certainty Factors, and the Dempster-Shafer method, have been proposed to handle uncertainty. Among them the Dempster-Shafer method is the most theoretical sound and consistent with human behavior; however, it is argued on its computational complexity. This article presents a parallel reasoning algorithm based on the Dempster-Shafer method and implements it on the transputer network. We first analyze the best topologies of the transputer network with various numbers of processors; then the performance of the parallel program, such a speedup and efficiency, is measured on these best topologies. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | UNCERTAIN REASONING | en_US |
dc.subject | DEMPSTER-SHAFER METHOD | en_US |
dc.subject | TRANSPUTER NETWORK | en_US |
dc.subject | PERFORMANCE ANALYSIS | en_US |
dc.subject | IMPLEMENTATION TECHNIQUES | en_US |
dc.title | ON PARALLELIZING THE DEMPSTER-SHAFER METHOD USING TRANSPUTER NETWORK | en_US |
dc.type | Article | en_US |
dc.identifier.journal | PARALLEL COMPUTING | en_US |
dc.citation.volume | 19 | en_US |
dc.citation.issue | 7 | en_US |
dc.citation.spage | 807 | en_US |
dc.citation.epage | 822 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:A1993LQ19300007 | - |
dc.citation.woscount | 0 | - |
顯示於類別: | 期刊論文 |