Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gilbert H. Young
2000 – 2009
- 2008
[j25]Joseph Y.-T. Leung, Chung-Yee Lee, Chung W. Ng, Gilbert H. Young: Preemptive multiprocessor order scheduling to minimize total weighted flowtime. European Journal of Operational Research 190(1): 40-51 (2008)- 2006
- [c17]
- 2005
- [c16]John Sum, Kevin Ho, Chung W. Ng, C. S. Wong, Gilbert H. Young: Analysis on the Session Life Time Distribution of Gnutella. PDPTA 2005: 1206-1214
- 2004
- [j24]Andrew Chi-Sing Leung, John Sum, Hong Shen, Jie Wu, Gilbert H. Young: Analysis and Design of an Agent Searching Algorithm for e-Marketplaces. Cluster Computing 7(1): 85-90 (2004)
- [c15]John Sum, Mingshu Li, Chung W. Ng, Tony Wong, Gilbert H. Young: A Study of the Connectedness of Gnutella. PDPTA 2004: 960-966
- 2003
- [j23]John Sum, Hong Shen, Gilbert H. Young, Jie Wu, Chi-Sing Leung: Analysis on Extended Ant Routing Algorithms for Network Routing and Management. The Journal of Supercomputing 24(3): 327-340 (2003)
- [j22]John Sum, Hong Shen, Andrew Chi-Sing Leung, Gilbert H. Young: Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management. IEEE Trans. Parallel Distrib. Syst. 14(3): 193-202 (2003)
- [c14]Chung W. Ng, Joseph Y.-T. Leung, Gilbert H. Young: Heuristics for Generalized Task System. PDPTA 2003: 1447-1453
- 2002
- [j21]Yu-Liang Wu, Wenqi Huang, Siu-Chung Lau, C. K. Wong, Gilbert H. Young: An effective quasi-human based heuristic for solving the rectangle packing problem. European Journal of Operational Research 141(2): 341-358 (2002)
- 2001
- [j20]Alvin T. S. Chan, Jiannong Cao, Henry C. B. Chan, Gilbert H. Young: A web-enabled framework for smart card applications in health services. Commun. ACM 44(9): 76-82 (2001)
- 2000
- [c13]Hong Shen, John Sum, Gilbert H. Young, Susumu Horiguchi: Efficient Dynamic Group Membership Updating for On-Line Communication in Optical WDM Networks (Preliminary Version). PDPTA 2000
- [c12]Hong Shen, John Sum, Gilbert H. Young, Susumu Horiguchi: Efficient Algorithms for On-line Communication in Optical WDM Networks (Preliminary Version). PDPTA 2000
1990 – 1999
- 1999
- [j19]Kwok-Shing Cheng, Gilbert H. Young, Kam-Fai Wong: A Study on Word-Based and Integral-Bit Chinese Text Compression Algorithms. JASIS 50(3): 218-228 (1999)
- [j18]J. P. F. Sum, Wing-Kay Kan, Gilbert H. Young: A Note on the Equivalence of NARX and RNN. Neural Computing and Applications 8(1): 33-39 (1999)
- [j17]John Sum, Andrew Chi-Sing Leung, Gilbert H. Young, Lai-Wan Chan, Wing-Kay Kan: An Adaptive Bayesian Pruning for Neural Networks in a Non-Stationary Environment. Neural Computation 11(4): 965-976 (1999)
- [j16]J. P. F. Sum, Chi-Sing Leung, Peter Kwong-Shun Tam, Gilbert H. Young, Wing-Kay Kan, Lai-Wan Chan: Analysis for a class of winner-take-all model. IEEE Transactions on Neural Networks 10(1): 64-71 (1999)
- [j15]John Sum, Chi-Sing Leung, Gilbert H. Young, Wing-Kay Kan: On the Kalman filtering method in neural network training and pruning. IEEE Transactions on Neural Networks 10(1): 161-166 (1999)
- [j14]Chi-Sing Leung, Gilbert H. Young, John Sum, Wing-Kay Kan: On the regularization of forgetting recursive least square. IEEE Transactions on Neural Networks 10(6): 1482-1486 (1999)
- 1998
- [j13]Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young: Minimizing Mean Flow Time with Error Constraint. Algorithmica 20(1): 101-118 (1998)
- [j12]Hong Shen, Keqin Li, Yi Pan, Gilbert H. Young, Shiqing Zhang: Performing Analysis for Dynamic Tree Embedding in k-Partite Networks by a Random Walk. J. Parallel Distrib. Comput. 50(1/2): 144-156 (1998)
- [j11]Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, Si-Qing Zheng: Lower Bounds for Dynamic Tree Embedding in Bipartite Networks. J. Parallel Distrib. Comput. 53(2): 119-143 (1998)
- [j10]John Sum, Lai-Wan Chan, Andrew Chi-Sing Leung, Gilbert H. Young: Extended Kalman Filter-Based Pruning Method for Recurrent Neural Networks. Neural Computation 10(6): 1481-1505 (1998)
- [c11]Xue-Jie Zhang, Kam-Wing Ng, Gilbert H. Young: High-Level Synthesis Using Genetic Algorithms for Dynamically Reconfigurable FPGAs (Abstract). FPGA 1998: 258
- 1997
- [c10]Hong Shen, Keqin Li, Yi Pan, Gilbert H. Young, Si-Qing Zheng: Performance analysis for dynamic tree embedding in k-partite networks by random walk. ISPAN 1997: 451-457
- [c9]Gilbert H. Young, Siu-Chung Lau, Vincent S. Yiu, Lai-man Wan: Nonpreemptive Scheduling on the Parallel Task System. PDPTA 1997: 484-487
- [c8]Gilbert H. Young, Lai-man Wan, Vincent S. Yiu: Reliable Parallel Processing on Heterogeneous Supercomputer via JMPI. PDPTA 1997: 498-
- [c7]Si-Qing Zheng, Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young: A Partitionability of Interconnection Networks. PDPTA 1997: 1349-1355
- 1996
- [j9]Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young: On-Line Routing of Real-Time Messages. J. Parallel Distrib. Comput. 34(2): 211-217 (1996)
- [j8]Jacqueline W. T. Wong, Wing-Kay Kan, Gilbert H. Young: ACTION: Automatic Classification For Full-Text Documents. SIGIR Forum 30(1): 26-41 (1996)
- [c6]Gilbert H. Young, Joseph Y.-T. Leung, Xue-Jie Zhang: Generalized Task System for Parallel Computation. PDPTA 1996: 241-244
- [c5]
- 1995
- [j7]Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young: Routing Messages with Release Time and Deadline Constraint. J. Parallel Distrib. Comput. 31(1): 65-76 (1995)
- [c4]Chi-lok Chan, Gilbert H. Young: Single-vehicle Scheduling Problem on a Straight Line with Time Window Constraints. COCOON 1995: 617-626
- 1994
- [c3]Gilbert H. Young, Chi-lok Chan: Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer. ISAAC 1994: 607-615
- 1993
- [c2]Chi-lok Chan, Gilbert H. Young: Scheduling Algorithms for a Chain-like Task System. ISAAC 1993: 496-505
- 1991
- [j6]Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young: Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time. Inf. Comput. 92(2): 219-236 (1991)
- 1990
- [j5]Joseph Y.-T. Leung, Gilbert H. Young: Minimizing Total Tardiness on a Single Machine with Precedence Constraints. INFORMS Journal on Computing 2(4): 346-352 (1990)
- [j4]Joseph Y.-T. Leung, Gilbert H. Young: Preemptive Scheduling to Minimize Mean Weighted Flow Time. Inf. Process. Lett. 34(1): 47-50 (1990)
- [j3]Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young, Francis Y. L. Chin: Packing Squares into a Square. J. Parallel Distrib. Comput. 10(3): 271-275 (1990)
- [j2]Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young: Minimizing Mean Flow Time with Release Time Constraint. Theor. Comput. Sci. 75(3): 347-355 (1990)
- [c1]Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young: On-Line Routing of Real-Time Messages. RTSS 1990: 126-135
1980 – 1989
- 1989
- [j1]Joseph Y.-T. Leung, Gilbert H. Young: Minimizing Schedule Length Subject to Minimum Flow Time. SIAM J. Comput. 18(2): 314-326 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-11 18:42 CEST by the dblp team