|
English
|
正體中文
|
简体中文
|
总笔数 :2832440
|
|
造访人次 :
33811753
在线人数 :
1453
教育部委托研究计画 计画执行:国立台湾大学图书馆
|
|
|
"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]项目
|
