OPTIMAL ASSIGNMENT OF TASK MODULES WITH PRECEDENCE FOR DISTRIBUTED-PROCESSING BY GRAPH MATCHING AND STATE-SPACE SEARCH
| dc.citation.epage | 68 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 54 | en_US |
| dc.citation.volume | 28 | en_US |
| dc.citation.woscount | 14 | |
| dc.contributor.author | WANG, LL | en_US |
| dc.contributor.author | TSAI, WH | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:06:01Z | |
| dc.date.available | 2014-12-08T15:06:01Z | |
| dc.date.issued | 1988 | en_US |
| dc.identifier.issn | 0006-3835 | en_US |
| dc.identifier.journal | BIT | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/4579 | |
| dc.identifier.wosnumber | WOS:A1988M934400005 | |
| dc.language.iso | en_US | en_US |
| dc.title | OPTIMAL ASSIGNMENT OF TASK MODULES WITH PRECEDENCE FOR DISTRIBUTED-PROCESSING BY GRAPH MATCHING AND STATE-SPACE SEARCH | en_US |
| dc.type | Article | en_US |