Go to Header
Go to Navigation
Go to Content
Go to Footer
Login
Help
中文（繁體）
Research Resources
CUHK UPDates
Theses
Experts List
User Guides
About Us
List of Researchers
> Emeritus Professor Chak Kuen WONG
Home
Research Outputs
Researcher Profiles
Department Profiles
Research Areas
Professor WONG Chak Kuen
Personal Information
Position and Department
Emeritus Professor
,
Department of Computer Science and Engineering
CUHK Research Outputs
1 of 3
Approximation of Boolean functions by local search
(
2004
)
Some results on resource constrained scheduling
(
2004
)
Analysis of FPGA/FPIC switch modules
(
2003
)
An experimental analysis of local minima to improve neighbourhood search
(
2003
)
Optimal on-line algorithms for scheduling on parallel batch processing machines
(
2003
)
Scheduling Two Groups of Jobs with Incomplete Information
(
2003
)
An automata network for performing combinatorial optimization
(
2002
)
An effective quasi-human based heuristic for solving the rectangle packing problem
(
2002
)
A simulated annealing and resampling method for training perceptrons to classify gene-expression data
(
2002
)
Bounded-depth threshold circuits for computer-assisted CT image classification
(
2002
)
Fast parallel heuristics for the job shop scheduling problem
(
2002
)
Reduction design for generic universal switch blocks
(
2002
)
The convergence of stochastic algorithms solving flow shop scheduling
(
2002
)
Two applications of the LSA machine
(
2002
)
A new model of simulated evolutionary computation - Convergence analysis and specifications
(
2001
)
Combining the perceptron algorithm with logarithmic simulated annealing
(
2001
)
Depth-four threshold circuits for computer-assisted X-ray diagnosis
(
2001
)
Liver Tissue Classification by Bounded-Depth Threshold Circuits
(
2001
)
Logarithmic simulated annealing for X-ray diagnosis
(
2001
)
Minimizing makespan on a single batch processing machine with nonidentical job sizes
(
2001
)
Non-Static Network Optimization Problems: A Survey
(
2001
)
On fixed edges and edge-reconstruction of series-parallel networks
(
2001
)
On-line algorithms for minimizing makespan on batch processing machines
(
2001
)
On the convergence of inhomogeneous Markov chains approximating equilibrium placements of flexible objects
(
2001
)
On The Signal Bounding Problem In Timing Analysis
(
2001
)
Steiner trees in general nonuniform orientations
(
2001
)
The K-r-packing problem
(
2001
)
Time-varying minimum cost flow problems
(
2001
)
Time-varying universal maximum flow problems
(
2001
)
A Problem-Specific Complexity Bound for Job Shop Scheduling
(
2000
)
Convergence analysis of simulated annealing-based algorithms solving flow shop scheduling problems
(
2000
)
Decomposition of graphs into (g, f)-factors
(
2000
)
Distributed simulated annealing for job Shop Scheduling
(
2000
)
Efficient heuristics for orientation metric and Euclidean Steiner tree problems
(
2000
)
Linear time-approximation algorithms for bin packing
(
2000
)
OBDD minimization based on two-level representation of Boolean functions
(
2000
)
On logarithmic simulated annealing
(
2000
)
On the bounded domination number of tournaments
(
2000
)
Rooted spanning trees in tournaments
(
2000
)
Self-complementary graphs and Ramsey numbers Part I: the decomposition and construction of self-complementary graphs
(
2000
)
Simulated annealing-based algorithms for the studies of the thermoelastic scaling behavior
(
2000
)
The maximum flow in a time-varying network
(
2000
)
Time-Varying Quickest Path Problems
(
2000
)
A Cogitative Algorithm for Solving the Equal Circles Packing Problem
(
1999
)
A Modified Perceptron Algorithm Using Logarithmic Cooling Functions
(
1999
)
Computation of Physical Properties of Materials Using Percolation Networks
(
1999
)
On k-ary spanning trees of tournaments
(
1999
)
On Parallel Heuristics for the Job Shop Scheduling Problem
(
1999
)
Programmable Logic Arrays
(
1999
)
Theory and Methodology Two Simulated Annealing-Based Heuristics for the Job Shop Scheduling Problem
(
1999
)
Share Link
Last updated on 2019-16-08 at 06:48
Share Link
Your name*
Your email*
Recipient's name*
Recipient's email*
Message
Auxilliary Information
No information will be stored or shared with any third party.
Cancel
Our policy towards the use of cookies
All Clarivate Analytics websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.
Ok to Continue
Cookie Policy