|
English
|
正體中文
|
简体中文
|
總筆數 :2833128
|
|
造訪人次 :
34233242
線上人數 :
1222
教育部委託研究計畫 計畫執行:國立臺灣大學圖書館
|
|
|
"hsiao ju yuan"的相關文件
顯示項目 26-35 / 35 (共2頁)
<< < 1 2
每頁顯示[10|25|50]項目
| 國立彰化師範大學 |
1998-05 |
An Improved Digital Cash Model Supported Anonymous Restore and Restricted Audit
|
Shih, T. W. ; Hsiao, Ju-Yuan; Chuang, L. Y. |
| 國立彰化師範大學 |
1998 |
Embedding meshes and TORUS networks onto degree-four chordal rings
|
Fang, J. F. ; Hsiao, Ju-Yuan; Tang, C. Y. |
| 國立彰化師範大學 |
1998 |
Embedding Incomplete Binary Trees into Incomplete Hypercubes
|
Huang, C. H. ; Hsiao, Ju-Yuan; Lee, R. C. T. |
| 國立彰化師範大學 |
1998 |
ILLIAC Networks and Degree Four Chordal Rings
|
Fang, J. F. ; Hsiao, Ju-Yuan; Tang, C. Y. |
| 國立彰化師範大學 |
1994-11 |
Single step searching in weighted block graphs
|
Hsiao, Ju-Yuan; Tang, C. Y. ; Chang, R. S. ; Lee, R. C. T. |
| 國立彰化師範大學 |
1993-10 |
The summation and bottleneck minimization for single step searching on weighted graphs
|
Hsiao, Ju-Yuan; Tang, C. Y. ; Chang, R. S. |
| 國立彰化師範大學 |
1992-10 |
An efficient algorithm for finding a maximum weight two-independent set on interval graphs
|
Hsiao, Ju-Yuan; Tang, C. Y. ; Chang, R. S. |
| 國立彰化師範大學 |
1992 |
A linear algorithm for solving the maximum weight two-independent set problem on block graphs
|
Hsiao, Ju-Yuan; Tang, C. Y. ; Chang, R. S. |
| 國立彰化師範大學 |
1991-12 |
Solving the single step graph searching problem by solving the maximum two-independent set problem
|
Hsiao, Ju-Yuan; Tang, C. Y. ; Chang, R. S. |
| 國立彰化師範大學 |
1991-09 |
Solving the single step graph searching problem by solving the maximum two-independent set problem
|
Hsiao, Ju-Yuan; Tang, C. Y. ; Chang, R. S. |
顯示項目 26-35 / 35 (共2頁)
<< < 1 2
每頁顯示[10|25|50]項目
|
