| 標題: | OPTIMAL SPEEDING UP OF PARALLEL ALGORITHMS BASED UPON THE DIVIDE-AND-CONQUER STRATEGY |
| 作者: | TANG, CY LEE, RCT 資訊工程學系 Department of Computer Science |
| 公開日期: | 1984 |
| URI: | http://hdl.handle.net/11536/4848 |
| ISSN: | 0020-0255 |
| 期刊: | INFORMATION SCIENCES |
| Volume: | 32 |
| Issue: | 3 |
| 起始頁: | 173 |
| 結束頁: | 186 |
| 顯示於類別： | 期刊論文 |
- LEARNING CONCEPTS IN PARALLEL BASED UPON THE STRATEGY OF VERSION SPACE / HONG, TP;TSENG, SS
- AN O(N LOG N) MINIMAL SPANNING TREE ALGORITHM FOR N-POINTS IN THE PLANE / CHANG, RC;LEE, RCT
- An intelligent two-stage evolutionary algorithm for dynamic pathway identification from gene expression profiles / Ho, Shinn-Ying;Hsieh, Chih-Hung;Yu, Fu-Chieh;Huang, Hui-Ling
- A PARALLEL ALGORITHM TO SOLVE THE STABLE MARRIAGE PROBLEM / TSENG, SS;LEE, RCT
- Divide-and-conquer learning and modular perceptron networks / Fu, HC;Lee, YP;Chiang, CC;Pao, HT
- 機器學習的平行與雜訊處理之研究 / 洪宗貝;Hong, Tzung-Pei;曾憲雄;Tseng, Shian-Shyong
- Evolutionary divide-and-conquer approach to inferring S-system models of genetic networks / Ho, SY;Hsieh, CH;Yu, FC;Huang, HL
Loading...