A GRAPH MATCHING APPROACH TO OPTIMAL TASK ASSIGNMENT IN DISTRIBUTED COMPUTING SYSTEMS USING A MINIMAX CRITERION
| dc.citation.epage | 203 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 197 | en_US |
| dc.citation.volume | 34 | en_US |
| dc.citation.woscount | 143 | |
| dc.contributor.author | SHEN, CC | en_US |
| dc.contributor.author | TSAI, WH | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:06:13Z | |
| dc.date.available | 2014-12-08T15:06:13Z | |
| dc.date.issued | 1985 | en_US |
| dc.identifier.issn | 0018-9340 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON COMPUTERS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/4799 | |
| dc.identifier.wosnumber | WOS:A1985ACF1400001 | |
| dc.language.iso | en_US | en_US |
| dc.title | A GRAPH MATCHING APPROACH TO OPTIMAL TASK ASSIGNMENT IN DISTRIBUTED COMPUTING SYSTEMS USING A MINIMAX CRITERION | en_US |
| dc.type | Article | en_US |