Wee-Chong Oon
Wee-Chong Oon [1]
Wee-Chong Oon, (Wee Chong Oon)
a Singaporean computer scientist and lecturer at Ngee Ann Polytechnic.
He holds a Ph.D. in computer science from National University of Singapore in 2007, and was postdoctoral researcher at City University of Hong Kong until 2011 [2].
His research interests include data structures and algorithms, operations research, artificial intelligence, machine learning and interactive and abstract games like Kalah and Backgammon.
Selected Publications
2000 ...
- Wee-Chong Oon, Andrew Lim (2002). Multi-Player Game Approach to Solving Multi-Entity Problems. AAAI/IAAI 2002, pdf
- Wee-Chong Oon, Yew Jin Lim (2003). An Investigation on Piece Differential Information in Co-Evolution on Games Using Kalah. CEC2003, Vol. 3, pdf
- Wee-Chong Oon, Martin Henz (2007). M2ICAL Analyses HC-Gammon. AAAI 2007 [5]
2010 ...
- Dejian Tu, Songshan Guo, Hu Qin, Wee-Chong Oon, Andrew Lim (2010). The Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading. AAAI 2010, pdf
- Yibo Chen, Wee-Chong Oon, Wenbin Zhu (2011). Ricochet Robots is Solved. ICGA Journal, Vol. 34, No. 4 [6]
- Yongquan Li, Andrew Lim, Wee-Chong Oon, Hu Qin, Dejian Tu (2011). The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. European Journal of Operational Research, Vol. 212, No. 3
- Wenbin Zhu, Zhixing Luo, Andrew Lim, Wee-Chong Oon (2016). A fast implementation for the 2D/3D box placement problem. Computational Optimization and Applications, Vol. 63
