| 嘉南藥理大學 |
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 |
| 臺大學術典藏 |
1992 |
Finding a Maximum Clique in Large-Scale Graphs
|
Yu, Chang-Sung; Yu, Chang-Sung |
| 國立臺灣大學 |
1992 |
Finding a Maximum Clique in Large-Scale Graphs
|
游張松; Yu, Chang-Sung |
| 臺大學術典藏 |
1994 |
Finding a Maximum Clique Through Coloring
|
Yu, Chang-Sung; Yu, Chang-Sung |
| 國立臺灣大學 |
1994 |
Finding a Maximum Clique Through Coloring
|
游張松; Yu, Chang-Sung |
| 國立交通大學 |
2014-12-08T15:05:00Z |
FINDING A MAXIMUM SET OF INDEPENDENT CHORDS IN A CIRCLE
|
CHANG, RC; LEE, HS |
| 國立臺灣海洋大學 |
1992 |
Finding a Maximum Set of Independent Chords in a Circle
|
R.C. Chang ; H.S. Lee |
| 國立成功大學 |
2008-02-29 |
Finding a maximum-density path in a tree under the weight and length constraints
|
Hsieh, Sun-Yuan; Cheng, Chih-Sheng |
| 亞洲大學 |
2016-06 |
Finding a Potential Dipeptidyl Peptidase-4 (DPP-4) Inhibitor for Type-2 Diabetes Treatment Based on Molecular Docking, Pharmacophore Generation, and Molecular Dynamics Simulation
|
Harika Meduru;王焰增;Wang, Yeng-Tseng;蔡進發;TSAI, JEFFREY J. P.;陳玉菁;CHEN, YU-CHING;* |
| 亞洲大學 |
2016-06 |
Finding a Potential Dipeptidyl Peptidase-4 (DPP-4) Inhibitor for Type-2 Diabetes Treatment Based on Molecular Docking, Pharmacophore Generation, and Molecular Dynamics Simulation
|
Medur, Harika;Meduru, Harika;王焰增;Wang, Yeng-Tseng;蔡進發;TSAI, JEFFREY J. P.;陳玉菁;CHEN*, YU-CHING |
| 臺大學術典藏 |
2021-10-21T23:27:38Z |
Finding a shortest even hole in polynomial time
|
Cheong, Hou Teng; HSUEH-I LU |
| 國立高雄應用科技大學 |
2006-07 |
Finding a suitable system scale to optimize program performance on software DSM systems
|
Zhuang, Yi-Chang;Chang, Jyh-Biau;Liang, Tyng-Yeu;Shieh, Ce-Kuen;Yang, Laurence Tianruo |
| 國立成功大學 |
2006-07 |
Finding a suitable system scale to optimize program performance on software DSM systems
|
Zhuang, Yi-Chang; Chang, Jyh-Biau; Liang, Tyng-Yeu; Shieh, Ce-Kuen; Yang, Laurence Tianruo |
| 國立中山大學 |
2003-08-28 |
Finding a Tree 4-Spanner on Trapezoid Graphs
|
Hon-Chan Chen; Shin-Huei Wu; Chang-Biau Yang |
| 國立成功大學 |
2005 |
Finding a weight-constrained maximum-density subtree in a tree
|
Hsieh, Sun-Yuan; Chou, Ting-Yu |
| 淡江大學 |
201103 |
Finding Active Membership Functions for Genetic-Fuzzy Data Mining
|
Chun-Hao Chen; Tzung-Pei Hong; Yeong-Chyi Lee; Vincent S. Tseng |
| 淡江大學 |
2015-12-01 |
Finding Active Membership Functions for Genetic-Fuzzy Mining
|
Chen, C. H.;Hong, T. P.;Lee, Yeong-Chyi;Tseng, Vincent S. |
| 義守大學 |
2004-11 |
Finding Active Membership Functions in Fuzzy Data Mining
|
Tzung-Pei Hong; Chun-Hao Chen ; Yu-Lung Wu; Shin-Mu Vincent Tseng |
| 臺大學術典藏 |
2018-09-10T07:32:41Z |
Finding all approximate gapped palindromes
|
Hsu, P.-H.;Chen, K.-Y.;Chao, K.-M.; Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2018-09-10T08:11:52Z |
Finding all approximate gapped palindromes
|
Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M.; Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO |
| 臺大學術典藏 |
2010 |
Finding all approximate gapped palindromes
|
KUN-MA0 CHAO; Hsu, P.-H.;Chen, K.-Y.;Chao, K.-M.; Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M. |
| 臺大學術典藏 |
2020-04-16T02:35:31Z |
Finding all approximate gapped palindromes
|
Hsu, P.-H.; Chen, K.-Y.; Chao, K.-M.; KUN-MA0 CHAO; Hsu, P.-H.;Chen, K.-Y.;Chao, K.-M. |
| 亞洲大學 |
2014-04 |
Finding all approximate palindromes of the string
|
黃建宏;Huang, Chien-Hung;陳立祺;Chen, Li-Chi;李家同;Lee, Chia-Tung;吳家樂;Ng, Ka-Lok |
| 亞洲大學 |
2014-04 |
Finding all approximate palindromes of the string
|
黃建宏;Chien-Hung Huang;陳立祺;Li-Chi Chen;李家同;Chia-Tung Lee;吳家樂;Ng, Ka-Lok |
| 中國醫藥大學 |
2014-02 |
Finding all approximate palindromes of the string
|
(Chien-Hung Huang);(Li-Chi Chen);(Chia-Tung Lee);吳家樂(Ka-Lok Ng)* |
| 國立臺灣科技大學 |
2015 |
Finding all best ties by a K shortest paths method of Dreyfus in a general digraph for routing control
|
Mizutani, E. |
| 國立虎尾科技大學 |
2007 |
Finding all Palindrome Subsequences in a String
|
K, R;R, C T;C, H |
