|
English
|
正體中文
|
简体中文
|
總筆數 :0
|
|
造訪人次 :
52529908
線上人數 :
1351
教育部委託研究計畫 計畫執行:國立臺灣大學圖書館
|
|
|
顯示項目 631306-631315 / 2348570 (共234857頁)
<< < 63126 63127 63128 63129 63130 63131 63132 63133 63134 63135 > >>
每頁顯示[10|25|50]項目
| 臺大學術典藏 |
2020-06-11T06:47:40Z |
On the Complexity of Self-assembly Tasks
|
Chen, H.-L.; Chen, H.-L.; CHEN HO-LIN |
| 國立臺灣科技大學 |
2014 |
On the complexity of SINR outage constrained max-min-fairness multicell coordinated beamforming problem
|
Li W.-C., Chang T.-H., Chi C.-Y. |
| 國立臺灣科技大學 |
2013 |
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
|
Kloks, T.;Poon, S.-H.;Tsai, F.-R.;Wang, Y.-L. |
| 國立政治大學 |
2016-04 |
On the complexity of the El Farol Bar Game: A sensitivity analysis
|
陳樹衡; Chen, Shu-Heng; Gostoli, Umberto |
| 國立政治大學 |
2016-12 |
On the complexity of the El Farol Bar game: a sensitivity analysis
|
陳樹衡; Chen, Shu-Heng; Gostoli, Umberto |
| 臺大學術典藏 |
1998 |
On the complexity of the k-chain subgraph cover problem
|
Yu, Chang-Wu; Chen, Gen-Huey; Ma, Tze-Heng; Yu, Chang-Wu; Chen, Gen-Huey; Ma, Tze-Heng |
| 國立臺灣大學 |
1998 |
On the complexity of the k-chain subgraph cover problem
|
Yu, Chang-Wu; Chen, Gen-Huey; Ma, Tze-Heng |
| 臺大學術典藏 |
2020-05-04T07:54:17Z |
On the Complexity of the k-Chain Subgraph Cover Problem.
|
Yu, Chang-Wu; Chen, Gen-Huey; Ma, Tze-Heng; GEN-HUEY CHEN |
| 中華大學 |
2007 |
On the Complexity of the Max-Edge-Coloring Problem with Its Variants
|
俞征武; Yu, Chang Wu |
| 國立交通大學 |
2014-12-08T15:27:22Z |
On the complexity of the minimum and maximum global snapshot problems
|
Chen, LB; Wu, IC |
顯示項目 631306-631315 / 2348570 (共234857頁)
<< < 63126 63127 63128 63129 63130 63131 63132 63133 63134 63135 > >>
每頁顯示[10|25|50]項目
|
