| 標題: | 在分散式記憶體多重處理機上分支與定界演算法之實證性探討 An empirical study of branch-and-bound algorithms for NP-Hard problems on distributed memory multi-processors |
| 作者: | 田博仁 TIAN, BO-REN 曾憲雄 ZENG, XIAN-XIONG 資訊科學與工程研究所 |
| 關鍵字: | 分散式記憶體;多重處理機;定界演算法;實證性探討 |
| 公開日期: | 1991 |
| URI: | http://140.113.39.130/cdrfb3/record/nctu/#NT802394014 http://hdl.handle.net/11536/55921 |
| Appears in Collections: | Thesis |
- 最少比較次數排序的分支與定界演算法 / 楊朝棟;YANG, CHAO-DONG;曾憲雄;ZENG, XIAN-XIONG
- A BOUND ANALYSIS OF SCHEDULING INSTRUCTIONS ON PIPELINED PROCESSORS WITH A MAXIMAL DELAY OF ONE CYCLE / CHOU, HC;CHUNG, CP
- Two-machine flow-shop scheduling to minimize total late work / Lin, BMT;Lin, FC;Lee, RCT
- A simple lower bound for total completion time minimization in a two-machine flowshop / Lin, BMT;Wu, JM
- Two-machine flow shop scheduling of polyurethane foam production / Lin, Bertrand M. T.;Lin, Y-Y;Fang, K-T
- Resource allocation in network processors for network intrusion prevention systems / Lin, Yi-Neng;Chang, Yao-Chung;Lin, Ying-Dar;Lai, Yuan-Chen
Loading...