The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gilbert H. Young: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Chi-lok Chan, Gilbert H. Young
    Single-vehicle Scheduling Problem on a Straight Line with Time Window Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:617-626 [Conf]
  2. Xue-Jie Zhang, Kam-Wing Ng, Gilbert H. Young
    High-Level Synthesis Using Genetic Algorithms for Dynamically Reconfigurable FPGAs (Abstract). [Citation Graph (0, 0)][DBLP]
    FPGA, 1998, pp:258- [Conf]
  3. Kevin Ho, John Sum, Gilbert H. Young
    Pricing Web Services. [Citation Graph (0, 0)][DBLP]
    GPC, 2006, pp:147-156 [Conf]
  4. Chi-lok Chan, Gilbert H. Young
    Scheduling Algorithms for a Chain-like Task System. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:496-505 [Conf]
  5. Gilbert H. Young, Chi-lok Chan
    Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:607-615 [Conf]
  6. 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. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:451-457 [Conf]
  7. Chung W. Ng, Joseph Y.-T. Leung, Gilbert H. Young
    Heuristics for Generalized Task System. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2003, pp:1447-1453 [Conf]
  8. Hong Shen, John Sum, Gilbert H. Young, Susumu Horiguchi
    Efficient Dynamic Group Membership Updating for On-Line Communication in Optical WDM Networks (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PDPTA, 2000, pp:- [Conf]
  9. Hong Shen, John Sum, Gilbert H. Young, Susumu Horiguchi
    Efficient Algorithms for On-line Communication in Optical WDM Networks (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    PDPTA, 2000, pp:- [Conf]
  10. John Sum, Kevin Ho, Chung W. Ng, C. S. Wong, Gilbert H. Young
    Analysis on the Session Life Time Distribution of Gnutella. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2005, pp:1206-1214 [Conf]
  11. John Sum, Mingshu Li, Chung W. Ng, Tony Wong, G. Young
    A Study of the Connectedness of Gnutella. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2004, pp:960-966 [Conf]
  12. Gilbert H. Young
    Complexity of Task Assignment in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1996, pp:779-782 [Conf]
  13. Gilbert H. Young, Siu-Chung Lau, Vincent S. Yiu, Lai-man Wan
    Nonpreemptive Scheduling on the Parallel Task System. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1997, pp:484-487 [Conf]
  14. Gilbert H. Young, Joseph Y.-T. Leung, Xue-Jie Zhang
    Generalized Task System for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1996, pp:241-244 [Conf]
  15. Gilbert H. Young, Lai-man Wan, Vincent S. Yiu
    Reliable Parallel Processing on Heterogeneous Supercomputer via JMPI. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1997, pp:498-0 [Conf]
  16. Si-Qing Zheng, Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young
    A Partitionability of Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1997, pp:1349-1355 [Conf]
  17. Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young
    On-Line Routing of Real-Time Messages. [Citation Graph (0, 0)][DBLP]
    IEEE Real-Time Systems Symposium, 1990, pp:126-135 [Conf]
  18. Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young
    Minimizing Mean Flow Time with Error Constraint. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:1, pp:101-118 [Journal]
  19. Alvin T. S. Chan, Jiannong Cao, Henry Chan, Gilbert H. Young
    A web-enabled framework for smart card applications in health services. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2001, v:44, n:9, pp:76-82 [Journal]
  20. Andrew Chi-Sing Leung, John Sum, Hong Shen, Jie Wu, Gilbert H. Young
    Analysis and Design of an Agent Searching Algorithm for e-Marketplaces. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2004, v:7, n:1, pp:85-90 [Journal]
  21. Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young
    Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:2, pp:219-236 [Journal]
  22. Joseph Y.-T. Leung, Gilbert H. Young
    Preemptive Scheduling to Minimize Mean Weighted Flow Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:1, pp:47-50 [Journal]
  23. Kwok-Shing Cheng, Gilbert H. Young, Kam-Fai Wong
    A Study on Word-Based and Integral-Bit Chinese Text Compression Algorithms. [Citation Graph (0, 0)][DBLP]
    JASIS, 1999, v:50, n:3, pp:218-228 [Journal]
  24. Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young
    Routing Messages with Release Time and Deadline Constraint. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:31, n:1, pp:65-76 [Journal]
  25. Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young, Francis Y. L. Chin
    Packing Squares into a Square. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1990, v:10, n:3, pp:271-275 [Journal]
  26. Joseph Y.-T. Leung, Tommy W. Tam, Gilbert H. Young
    On-Line Routing of Real-Time Messages. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:34, n:2, pp:211-217 [Journal]
  27. Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, Si-Qing Zheng
    Lower Bounds for Dynamic Tree Embedding in Bipartite Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:53, n:2, pp:119-143 [Journal]
  28. 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. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:50, n:1/2, pp:144-156 [Journal]
  29. J. P. F. Sum, Wing-kay Kan, Gilbert H. Young
    A Note on the Equivalence of NARX and RNN. [Citation Graph (0, 0)][DBLP]
    Neural Computing and Applications, 1999, v:8, n:1, pp:33-39 [Journal]
  30. John Sum, Lai-Wan Chan, Andrew Chi-Sing Leung, Gilbert H. Young
    Extended Kalman Filter-Based Pruning Method for Recurrent Neural Networks. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1998, v:10, n:6, pp:1481-1505 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1999, v:11, n:4, pp:965-976 [Journal]
  32. Joseph Y.-T. Leung, Gilbert H. Young
    Minimizing Schedule Length Subject to Minimum Flow Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:314-326 [Journal]
  33. Jacqueline W. T. Wong, Wing-kay Kan, Gilbert H. Young
    ACTION: Automatic Classification For Full-Text Documents. [Citation Graph (0, 0)][DBLP]
    SIGIR Forum, 1996, v:30, n:1, pp:26-41 [Journal]
  34. Jianzhong Du, Joseph Y.-T. Leung, Gilbert H. Young
    Minimizing Mean Flow Time with Release Time Constraint. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:75, n:3, pp:347-355 [Journal]
  35. John Sum, Hong Shen, Andrew Chi-Sing Leung, Gilbert H. Young
    Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:3, pp:193-202 [Journal]
  36. 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. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:341-358 [Journal]

Search in 0.312secs, Finished in 0.314secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002