|
English
|
正體中文
|
简体中文
|
總筆數 :0
|
|
造訪人次 :
53324251
線上人數 :
1011
教育部委託研究計畫 計畫執行:國立臺灣大學圖書館
|
|
|
"yang hsu hao"的相關文件
顯示項目 1-10 / 15 (共2頁)
1 2 > >>
每頁顯示[10|25|50]項目
| 國立勤益科技大學 |
2009-03 |
On genetic algorithms for shoe making nesting–A Taiwan case
|
Yang, Hsu-Hao;Lin, Chien-Li |
| 國立勤益科技大學 |
2007 |
Visualization of machine clustering for a Taiwanese IC packaging foundry
|
Yang, Hsu-Hao ; Kang, He-Yau ; Liu, Tzu-Chiang |
| 國立勤益科技大學 |
2007 |
Applying rough sets to prevent customer complaints for IC packaging foundry
|
Yang, Hsu-Hao ; Liu, Tzu-Chiang ; Lin, Yen-Ting |
| 國立勤益科技大學 |
2007 |
Applying rough sets to prevent customer complaints for IC packaging foundry
|
Yang, Hsu-Hao; Liu, Tzu-Chiang; Lin, Yen-Ting |
| 國立勤益科技大學 |
2007 |
Visualization of Machine Clustering for a Taiwanese IC Packaging Foundry
|
Yang, Hsu-Hao ; Kang, He-Yau ; Liu, Tzu-Chiang |
| 國立勤益科技大學 |
2007 |
Visualization of machine clustering for a Taiwanese IC packaging foundry
|
Yang, Hsu-Hao ; Kang, He-Yau ; Liu, Tzu-Chiang |
| 國立勤益科技大學 |
2006 |
Finding k shortest looping paths with waiting time in a time-window network
|
Yang, Hsu-Hao ; Chen, Yen-Liang |
| 國立勤益科技大學 |
2005 |
Finding k shortest looping paths in a traffic-light network
|
Yang, Hsu-Hao ; Chen, Yen-Liang |
| 國立勤益科技大學 |
2004 |
The first K shortest unique-arc walks in a traffic-light network
|
Yang, Hsu-Hao ; Chen, Yen-Liang |
| 國立勤益科技大學 |
2004 |
Finding the first K shortest paths in a time-window network
|
Chen, Yen-Liang ; Yang, Hsu-Hao |
顯示項目 1-10 / 15 (共2頁)
1 2 > >>
每頁顯示[10|25|50]項目
|
