| 國立臺灣大學 |
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. |
