An effective quasi-human based heuristic for solving the rectangle packing problem von Wu, Yu-Liang, Huang, Wenqi, Lau, Siu-chung, Wong, C.K, Young, Gilbert H

Volltext

A study on word-based and integral-bit Chinese text compression algorithms von Cheng, Kwok-Shing, Young, Gilbert H., Wong, Kam-Fai

Volltext

Minimizing schedule length subject to minimum flow time von LEUNG, J. Y.-T, YOUNG, G. H

Volltext

Preemptive scheduling to minimize mean weighted flow time von Leung, Joseph Y-T., Young, Gilbert H.

Volltext

On the Kalman filtering method in neural network training and pruning von Sum, J., Chi-Sing Leung, Young, G.H., Wing-Kay Kan

Volltext

Minimizing Total Tardiness on a Single Machine with Precedence Constraints von Leung, Joseph Y.-T, Young, Gilbert H

Volltext

Analysis for a class of winner-take-all model von Sum, J.P.F., Chi-Sing Leung, Tam, P.K.S., Young, G.H., Kan, W.K., Lai-Wan Chan

Volltext

On the regularization of forgetting recursive least square von Chi Sing Leung, Young, G.H., Sum, J., Wing-Kay Kan

Volltext

Extended Kalman Filter–Based Pruning Method for Recurrent Neural Networks von Sum, John, Chan, Lai-wan, Leung, Chi-sing, Young, Gilbert H.

Volltext

Packing squares into a square von Leung, Joseph Y-T., Tam, Tommy W., Wong, C.S., Young, Gilbert H., Chin, Francis Y.L.

Volltext

An Adaptive Bayesian Pruning for Neural Networks in a Non-Stationary Environment von Sum, John, Leung, Chi-sing, Young, Gilbert H., Chan, Lai-wan, Kan, Wing-kay

Volltext

Scheduling chain-structured tasks to minimize makespan and mean flow time von Du, Jianzhong, Leung, Joseph Y-T., Young, Gilbert H.

Volltext

Efficient algorithms for assigning chain-like tasks on a chain-like network computer von Young, Gilbert H., Chan, Chi-Lok

Volltext

Lower Bounds for Dynamic Tree Embedding in Bipartite Networks von Li, Keqin, Pan, Yi, Shen, Hong, Young, Gilbert H., Zheng, Si Qing

Volltext

Minimizing mean flow time with release time constraint von Du, Jianzhong, Leung, Joseph Y.-T., Young, Gilbert H.

Volltext

Routing Messages with Release Time and Deadline Constraint von Leung, J.Y.T., Tam, T.W., Wong, C.S., Young, G.H.

Volltext

On-Line Routing of Real-Time Messages von Leung, Joseph Y-T., Tam, Tommy W., Young, Gilbert H.

Volltext

Single-vehicle scheduling problem on a straight line with time window constraints von Chan, Chi-lok, Young, Gilbert H.

Volltext

A study on word-based and integral-bit Chinese text compression algorithms von Cheng, Kwok-Shing, Young, Gilbert H, Wong, Kam-Fai

Volltext

Scheduling Real-Time Jobs with Chain Tree Temporal Distance Constraints von Young, Gilbert H., Wa Ng, Chung

Volltext