# Gilbert H. Young

According to our database

Collaborative distances:

^{1}, Gilbert H. Young authored at least 41 papers between 1989 and 2008.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2008

Preemptive multiprocessor order scheduling to minimize total weighted flowtime.

European Journal of Operational Research, 2008

2006

Pricing Web Services.

Proceedings of the Advances in Grid and Pervasive Computing, 2006

2005

Analysis on the Session Life Time Distribution of Gnutella.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

2004

Analysis and Design of an Agent Searching Algorithm for e-Marketplaces.

Cluster Computing, 2004

A Study of the Connectedness of Gnutella.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

2003

Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management.

IEEE Trans. Parallel Distrib. Syst., 2003

Analysis on Extended Ant Routing Algorithms for Network Routing and Management.

The Journal of Supercomputing, 2003

Heuristics for Generalized Task System.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

2002

An effective quasi-human based heuristic for solving the rectangle packing problem.

European Journal of Operational Research, 2002

2001

A web-enabled framework for smart card applications in health services.

Commun. ACM, 2001

2000

Efficient Algorithms for On-line Communication in Optical WDM Networks (Preliminary Version).

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

Efficient Dynamic Group Membership Updating for On-Line Communication in Optical WDM Networks (Preliminary Version).

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

1999

On the Kalman filtering method in neural network training and pruning.

IEEE Trans. Neural Networks, 1999

Analysis for a class of winner-take-all model.

IEEE Trans. Neural Networks, 1999

On the regularization of forgetting recursive least square.

IEEE Trans. Neural Networks, 1999

An Adaptive Bayesian Pruning for Neural Networks in a Non-Stationary Environment.

Neural Computation, 1999

A Note on the Equivalence of NARX and RNN.

Neural Computing and Applications, 1999

A Study on Word-Based and Integral-Bit Chinese Text Compression Algorithms.

JASIS, 1999

1998

Extended Kalman Filter-Based Pruning Method for Recurrent Neural Networks.

Neural Computation, 1998

Performing Analysis for Dynamic Tree Embedding in k-Partite Networks by a Random Walk.

J. Parallel Distrib. Comput., 1998

Lower Bounds for Dynamic Tree Embedding in Bipartite Networks.

J. Parallel Distrib. Comput., 1998

Minimizing Mean Flow Time with Error Constraint.

Algorithmica, 1998

High-Level Synthesis Using Genetic Algorithms for Dynamically Reconfigurable FPGAs (Abstract).

Proceedings of the 1998 ACM/SIGDA Sixth International Symposium on Field Programmable Gate Arrays, 1998

1997

A Partitionability of Interconnection Networks.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

Reliable Parallel Processing on Heterogeneous Supercomputer via JMPI.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

Nonpreemptive Scheduling on the Parallel Task System.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

Performance analysis for dynamic tree embedding in k-partite networks by random walk.

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1996

ACTION: Automatic Classification For Full-Text Documents.

SIGIR Forum, 1996

Generalized Task System for Parallel Computation.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

Complexity of Task Assignment in Distributed Systems.

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

1995

Routing Messages with Release Time and Deadline Constraint.

J. Parallel Distrib. Comput., 1995

Single-vehicle Scheduling Problem on a Straight Line with Time Window Constraints.

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Efficient Algorithms for Assigning Chain-Like Tasks on a Chain-Like Network Computer.

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

Scheduling Algorithms for a Chain-like Task System.

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1991

Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time

Inf. Comput., June, 1991

1990

Minimizing Mean Flow Time with Release Time Constraint.

Theor. Comput. Sci., 1990

Packing Squares into a Square.

J. Parallel Distrib. Comput., 1990

Preemptive Scheduling to Minimize Mean Weighted Flow Time.

Inf. Process. Lett., 1990

Minimizing Total Tardiness on a Single Machine with Precedence Constraints.

INFORMS Journal on Computing, 1990

On-Line Routing of Real-Time Messages.

Proceedings of the Real-Time Systems Symposium, 1990

1989

Minimizing Schedule Length Subject to Minimum Flow Time.

SIAM J. Comput., 1989