|
English
|
正體中文
|
简体中文
|
0
|
|
???header.visitor??? :
52703095
???header.onlineuser??? :
943
???header.sponsordeclaration???
|
|
|
|
???tair.name??? >
???browser.page.title.title???
|
Showing items 466746-466770 of 2348638 (93946 Page(s) Totally)
<< < 18665 18666 18667 18668 18669 18670 18671 18672 18673 18674 > >>
View [10|25|50] records per page
| 臺大學術典藏 |
2008-12 |
Heuristic Algorithms for Replication Transition Problem in the Grid Systems
|
Hsu, Chun-Chen; Wang, Chien-Min; Liu, Pangfeng; Hsu, Chun-Chen; Wang, Chien-Min; Liu, Pangfeng |
| 國立臺灣大學 |
2008-12 |
Heuristic Algorithms for Replication Transition Problem in the Grid Systems
|
Hsu, Chun-Chen; Wang, Chien-Min; Liu, Pangfeng |
| 臺大學術典藏 |
2020-05-04T08:02:34Z |
Heuristic algorithms for replication transition problem in the grid systems
|
Hsu, C.-C.; Liu, P.; Wang, C.-M.; PANGFENG LIU |
| 臺大學術典藏 |
2008 |
Heuristic Algorithms for Replication Transition Problem in the Grid Systems.
|
PANGFENG LIU; Wang, Chien-Min; Liu, Pangfeng; Hsu, Chun-Chen |
| 淡江大學 |
2007-08-24 |
Heuristic Algorithms for the Dynamic Taxipooling Problem Based on Intelligent Transportation System Technologies
|
陶治中; Tao, Chi-chung; 陳俊穎; Chen, Chun-ying |
| 國立臺灣科技大學 |
2012 |
Heuristic algorithms for two-dimensional uplink burst construction in IEEE 802.16 networks
|
Lai, Y.-C.;Chen, Y.-H. |
| 國立臺北護理健康大學 |
2012-01 |
Heuristic algorithms for two-dimensional uplink burst construction in IEEE 802.16 networks
|
Lai, Yuan-Cheng; Chen, Yen-Hung |
| 國立勤益科技大學 |
2009-02 |
Heuristic algorithms for two-machine flowshop with availability constraints
|
Liao, Li-Man;Tsai, Chin-Hui |
| 國立勤益科技大學 |
2009-02 |
Heuristic algorithms for two-machine flowshop with availability constraints
|
廖麗滿 |
| 亞洲大學 |
1993 |
Heuristic algorithms for UET-scheduling problem with constrained processor allocation
|
D. R. Din;S. S. Tseng |
| 國立彰化師範大學 |
1993-12 |
Heuristic algorithms for UET-scheduling problem with constrained processor allocations
|
Din, Der-Rong; Tseng, S. S. |
| 國立交通大學 |
2014-12-08T15:11:26Z |
Heuristic algorithms to solve the capacity allocation problem in photolithography area (CAPPA)
|
Chung, Shu-Hsing; Huang, Chun-Ying; Lee, Amy H. I. |
| 中華大學 |
2008 |
Heuristic algorithms to solve the capacity allocation problem in photolithography area (CAPPA)
|
李欣怡; Lee, Amy Hsin-I |
| 國立彰化師範大學 |
2005 |
Heuristic and Hybrid Methods for Solving Optimal Multiple Multicast Problem on WDM Ring Network
|
Din, Der-Rong |
| 國立彰化師範大學 |
2002-02 |
Heuristic and Simulated Annealing Algorithms for Solving Extended Cell Assignment Problem in Wireless ATM Network
|
Din, Der-Rong ; Tseng, S. S. |
| 國立交通大學 |
2014-12-08T15:42:52Z |
Heuristic and simulated annealing algorithms for solving extended cell assignment problem in wireless ATM networks
|
Din, DR; Tseng, SS |
| 亞洲大學 |
2002-01 |
Heuristic and simulated annealing algorithms for solving extended cell assignment problem in wireless ATM networks
|
D. R. Din; S. S. Tseng |
| 國立彰化師範大學 |
2008-03 |
Heuristic and simulated annealing algorithms for wireless ATM backbone network design problem
|
Din, Der-Rong |
| 國立交通大學 |
2014-12-08T15:18:07Z |
Heuristic approach for solving the multi-objective facility layout problem
|
Chen, CW; Sha, DY |
| 國立成功大學 |
2012-06-13 |
Heuristic Approach to Incorporate Timesharing Schemes in Multiperiod Heat Exchanger Network Designs
|
Sadeli, Efrat; Chang, Chuei-Tin |
| 元智大學 |
2012-12-02 |
Heuristic Approaches for Minimizing Reshuffle Operations at Container Yard
|
吳崑誌; Ching-Jung Ting |
| 南台科技大學 |
2000-02 |
Heuristic Block Distortion Measure in Block Motion Estimation
|
Shung-Chih Chen; Pei-Yin Chen |
| 國立臺灣科技大學 |
2020 |
Heuristic creation of deep rule ensemble through iterative expansion of feature space
|
Liu, H.;Chen, S.-M. |
| 淡江大學 |
2025-12-02 |
Heuristic Design for Humanoid Robots
|
Yang, Jeehyun;Jeong, Jaesik |
| 國立交通大學 |
2014-12-08T15:37:10Z |
Heuristic dispatching rule to maximize TDD and IDD performance
|
Ho, TF; Li, RK |
Showing items 466746-466770 of 2348638 (93946 Page(s) Totally)
<< < 18665 18666 18667 18668 18669 18670 18671 18672 18673 18674 > >>
View [10|25|50] records per page
|
