| 嘉南藥理大學 |
2001 |
FINASTERIDE在FAPG及水性凝膠劑中經皮吸收之研究
|
許立人 |
| 嘉南藥理大學 |
2003 |
Finasteride在FAPG及水性凝膠劑中經皮吸收之研究
|
許立人; 林恆弘; 方嘉德; 劉孟慈; 郭慧君; 塗紹玉 |
| 國立臺灣科技大學 |
2002 |
Find all longer and shorter boundary duration vectors under project time and budget constraints
|
Lin, Yi-Kuei |
| 朝陽科技大學 |
106-11 |
Find crucial factors of in-game purchase using neural networks
|
陳隆昇 |
| 朝陽科技大學 |
2017-11 |
Find crucial factors of in-game purchase using neural networks
|
陳隆昇 |
| 國立臺灣科技大學 |
2016-09 |
Find Fun
|
張文卓 |
| 國立交通大學 |
2019-05-02T00:26:49Z |
Finder: Automatic ICC Data Reconstruction for Long-Term Runtime Semantics
|
Hsu, Chia-Wei; Wei, Sheng-Ru; Shieh, Shiuhpyng |
| 臺大學術典藏 |
2020-01-22T07:45:56Z |
Finding 3D motifs in ribosomal RNA structures
|
Williams L.D.; CHIAO-LONG HSIAO; Hsiao C.; Heitsch C.E.; Guerra C.; Apostolico A.; Ciriello G. |
| 國立臺灣海洋大學 |
2014-02 |
Finding a balance between economic performance and capacity efficiency for sustainable fisheries: case of the Da Nang gillnet fishery, Vietnam
|
Thi Duy Thanh Pham;Hsiang-Wen Huang*;Ching-Ta Chuang;; 黃向文 |
| 國立臺灣海洋大學 |
2013 |
Finding a balance between economic performance and capacity efficiency for sustainable fisheries: Case of the Da Nang gillnet fishery, Vietnam
|
Thi Duy Thanh Pham;Huang Hsiang-Wen;Chuang Ching-Ta;; 莊慶達 |
| 國立交通大學 |
2014-12-08T15:04:36Z |
FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS
|
TSENG, FSC; YANG, WP; CHEN, ALP |
| 國立高雄第一科技大學 |
1993.03 |
Finding a complete matching with the maximum product on weighted bipartite graphs
|
Frank, S.C.Tseng;Yang, Wei-Pang; 曾守正 |
| 國立政治大學 |
1993-03 |
Finding a complete matching with the maximum product on weighted bipartite graphs
|
陳良弼; Tseng,Frank S.C.;Yang,Wei-Pang;Chen,Arbee L.P. |
| 元智大學 |
2021/12/10 |
Finding a consecutive subsequence of group elements with a given product
|
Ching-Lueh Chang |
| 國立臺灣大學 |
2005 |
Finding a Length-Constrained Maximum-Density Path in a Tree
|
Lin, Rung-Ren; Kuo, Wen-Hsiung; Chao, Kun-Mao |
| 國立臺灣大學 |
2005-03 |
Finding a Length-Constrained Maximum-Density Path in a Tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M. |
| 國立臺灣大學 |
2003 |
Finding a Length-Constrained Maximum-Density Path in a Tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M. |
| 臺大學術典藏 |
2018-09-10T05:20:01Z |
Finding a length-constrained maximum-density path in a tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T04:30:43Z |
Finding a length-constrained maximum-density path in a tree
|
Lin, R.-R.; Kuo, W.-H.; Chao, K.-M.; KUN-MA0 CHAO |
| 國立暨南國際大學 |
2008 |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
|
李家同; Lee, RCT |
| 國立暨南國際大學 |
2008 |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
|
王有禮; Wang, YL |
| 國立臺灣科技大學 |
2007 |
Finding a Longest Common Subsequence between a Run-Length-Encoded String and an Uncompressed String
|
Liu, J. J. ;Wang, Y. L.;Lee, R.C.T. |
| 國立臺灣科技大學 |
2008 |
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
|
Liu, J.J.;Wang, Y.L.;Lee, R.C.T. |
| 臺大學術典藏 |
2018-09-10T06:04:30Z |
Finding a Maximum Clique in an Arbitrary Graph
|
CHANG-SUNG YU; CHANG-SUNG YU; CHANG-SUNG YU |
| 臺大學術典藏 |
2020-03-06T03:40:39Z |
FINDING A MAXIMUM CLIQUE IN AN ARBITRARY GRAPH.
|
Balas Egon, Yu Chang Sung; Balas Egon, Yu Chang Sung; CHANG-SUNG YU |
