|
English
|
正體中文
|
简体中文
|
总笔数 :0
|
|
造访人次 :
52535386
在线人数 :
765
教育部委托研究计画 计画执行:国立台湾大学图书馆
|
|
|
显示项目 93366-93375 / 2348570 (共234857页)
<< < 9332 9333 9334 9335 9336 9337 9338 9339 9340 9341 > >>
每页显示[10|25|50]项目
| 臺北醫學大學 |
2008 |
A Borrowed Voice: Taiwan Human Rights through International Networks; 1960-1980
|
艾琳達; Linda Gail Arrigo |
| 國立臺灣科技大學 |
2006 |
A borrowing-based call admission control policy for mobile multimedia wireless networks
|
Chang, J.-Y.;Chen, H.-L. |
| 國立虎尾科技大學 |
2006 |
A Borrowing-Based Call Admission Control Policy for Mobile Multimedia Wireless Networks
|
Chang, Jau-Yang;Chen, Hsing-Lung |
| 國立政治大學 |
2009-11 |
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
|
陳春龍; Chen, Chun-Lung;Chen, Chuen-Lung |
| 國立中山大學 |
2004 |
A bottom up discovery of generalized web browsing patterns
|
W.S. Lo;S.L. Wang;T.P. Hong |
| 國立中山大學 |
2009-03 |
A Bottom-UP Exploration Approach for 3D Graphics Hardware Accelerator in Consumer Electronics
|
Chi-Tsai Yeh;Liang-Bi Chen;Ching-Yuan Lin;Hung-Yu Chen;Ing-Jer Huang |
| 國立交通大學 |
2014-12-08T15:04:57Z |
A BOUND ANALYSIS OF SCHEDULING INSTRUCTIONS ON PIPELINED PROCESSORS WITH A MAXIMAL DELAY OF ONE CYCLE
|
CHOU, HC; CHUNG, CP |
| 大葉大學 |
2002 |
A bound for efficiency in multiple response designs
|
高立箴 |
| 國立中山大學 |
1999 |
A bound for the game chromatic number of graphs
|
T. Dinski ;X. Zhu |
| 國立交通大學 |
2017-04-21T06:55:33Z |
A bound on the Laplacian spread which is tight for strongly regular graphs
|
Lin, Fan-Hsuan; Weng, Chih-wen |
显示项目 93366-93375 / 2348570 (共234857页)
<< < 9332 9333 9334 9335 9336 9337 9338 9339 9340 9341 > >>
每页显示[10|25|50]项目
|
