![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Andrew Lim Gaofeng Huang , Andrew Lim: A Simple Yet Effective Framework for Optimization Problems. AMAI 2004 Yi Zhu , Andrew Lim: Crane Scheduling with Spatial Constraints: Mathematical Models and Solving Approaches. AMAI 2004 Andrew Lim, Brian Rodrigues , Fei Xiao : A Centroid-Based Approach to Solve the Bandwidth Minimization Problem. HICSS 2004 H. Ding , Andrew Lim, Brian Rodrigues , Yi Zhu : Aircraft and Gate Scheduling Optimization at Airports. HICSS 2004 Zhiye Li , Songshan Guo , Fan Wang , Andrew Lim: Improved GRASP with Tabu Search for Vehicle Routing with Both Time Window and Limited Number of Vehicles. IEA/AIE 2004 : 552-561 Ying Kong , Fan Wang , Andrew Lim, Songshan Guo : A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem. Australian Conference on Artificial Intelligence 2003 : 125-136 Gaofeng Huang , Andrew Lim: Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem. GECCO 2003 : 1053-1064 Andrew Lim, Brian Rodrigues , Fei Xiao : Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem. GECCO 2003 : 1594-1595 Andrew Lim, Zhou Xu : A Fixed-Length Subset Genetic Algorithm for the p-Median Problem. GECCO 2003 : 1596-1597 Ping Chen , Zhaohui Fu , Andrew Lim, Brian Rodrigues : The General Yard Allocation Problem. GECCO 2003 : 1986-1997 Ping Chen , Zhaohui Fu , Andrew Lim, Brian Rodrigues : Two-Dimensional acking For Irregular Shaped Objects. HICSS 2003 : 86 Yi Zhu , Andrew Lim, Brian Rodrigues : Aircraft and Gate Scheduling with Time Windows. ICTAI 2003 : 189-193 Gaofeng Huang , Andrew Lim: Fragmental Optimization on the 2-Machine Bicriteria Flowshop Scheduling Problem. ICTAI 2003 : 194- Yunsong Guo , Andrew Lim, Brian Rodrigues : Transportation Bid Analysis Optimization with Shipper Input. ICTAI 2003 : 290- Andrew Lim, Brian Rodrigues , Fei Xiao : A New Node Centroid Algorithm for Bandwidth Minimization. IJCAI 2003 : 1544-1545 Haibing Li , Andrew Lim, Brian Rodrigues : A Hybrid AI Approach for Nurse Rostering Problem. SAC 2003 : 730-735 Andrew Lim, Brian Rodrigues , Lei Song : Manpower Scheduling with Time Windows. SAC 2003 : 741-746 Chen Qun , Andrew Lim, Kian Win Ong : D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data. SIGMOD Conference 2003 : 134-144 Kai Song Goh , Andrew Lim, Brian Rodrigues : Sexual Selection for Genetic Algorithms. Artif. Intell. Rev. 19 (2): 123-152 (2003) Andrew Lim, Juay Chin Ang , Wee-Kit Ho , Wee-Chong Oon : UTTSExam: A University Examination Timetable Scheduler. AAAI/IAAI 2002 : 1004-1005 Ping Chen , Zhaohui Fu , Andrew Lim: The Yard Allocation Problem. AAAI/IAAI 2002 : 3-8 Andrew Lim, Juay Chin Ang , Wee-Kit Ho , Wee-Chong Oon : UTTSExam: A Campus-Wide University Exam-Timetabling System. AAAI/IAAI 2002 : 838-844 Wee-Chong Oon , Andrew Lim: Multi-Player Game Approach to Solving Multi-Entity Problems. AAAI/IAAI 2002 : 961-962 Andrew Lim, Brian Rodrigues , Ramesh Thangarajo , Fei Xiao : Over-Constrained Resource-Constrained Scheduling Problems with Prioritized Activities. FSKD 2002 : 672-676 Ping Chen , Zhaohui Fu , Ping Chen , Andrew Lim: Using Genetic Algorithms To Solve The Yard Allocation Problem. GECCO 2002 : 1049-1056 Andrew Lim, Brian Rodrigues , Fei Xiao , Yi Zhu : Crane Scheduling Using Tabu Search. ICTAI 2002 : 146-153 Andrew Lim, Brian Rodrigues , Fei Xiao , Xingwen Zhang : Adjusted Network Flow for the Shelf-Space Allocation Problem. ICTAI 2002 : 224- Wee-Chong Oon , Andrew Lim: Multi-Player Game Approach to Scheduling Problems. ISPAN 2002 : 205- Haibing Li , Andrew Lim: Local search with annealing-like restarts to solve the vehicle routing problem with time windows. SAC 2002 : 560-565 Chen Qun , Andrew Lim, Wee-Chong Oon : Page Access Sequencing in Join Processing with Limited Buffer Space. DEXA 2001 : 380-389 Chen Qun , Andrew Lim, Yi Zhu : Index and Data Allocation in Mobile Broadcast. DEXA 2001 : 785-794 Wee-Kit Ho , Andrew Lim: A Hybrid-Based Framework for Constraint Satisfaction Optimization Problems. ICIS 2001 : 65-76 Haibing Li , Andrew Lim: A Metaheuristic for the Pickup and Delivery Problem with Time Windows. ICTAI 2001 : 160- Wee-Kit Ho , Andrew Lim, Wee-Chong Oon : Maximizing Paper Spread in Examination Timetabling Using a Vehicle Routing Method. ICTAI 2001 : 359-366 Andrew Lim, Wang Ying : A New Method For The Three Dimensional Container Packing Problem. IJCAI 2001 : 342-350 Andrew Lim, Jennifer Lai-Pheng Kwan , Wee-Chong Oon : Page access scheduling in join processing. Data Knowl. Eng. 37 (3): 267-284 (2001) Wee-Kit Ho , Juay Chin Ang , Andrew Lim: A Hybrid Search Algorithm for the Vehicle Routing Problem with Time Windows. International Journal on Artificial Intelligence Tools 10 (3): 431-449 (2001) Andrew Lim, Ang Juay Chin , Ho Wee Kit , Wee-Chong Oon : A Campus-Wide University Examination Timetabling Application. AAAI/IAAI 2000 : 1020-1015 Hoong Chuin Lau , Andrew Lim, Qi Zhang Liu : Solving a Supply Chain Optimization Problem Collaboratively. AAAI/IAAI 2000 : 780-785 Andrew Lim, O. W. Chong , Chi-Hung Chi : A New Algorithm for Page Access Sequencing in Join Processing. ADBIS-DASFAA 2000 : 128-141 Chi Chi-Huing , Li Xiang , Andrew Lim: Dynamically Transcoding Data Quality for Faster Web Access. HPCN Europe 2000 : 527-530 Zhaohui Fu , Andrew Lim: Heuristics for the exam scheduling problem. ICTAI 2000 : 172-175 Dennis Joshua Chia , Andrew Lim: Local search algorithm for the compacted cells area problem. ICTAI 2000 : 294-297 Kai Song Goh , Andrew Lim: Combining various algorithms to solve the ship berthing problem. ICTAI 2000 : 370- Kai Song Goh , Andrew Lim: Algorithms for Solving the Ship Berthing Problem. PRICAI 2000 : 797 Chia Jim Tong , Hoong Chuin Lau , Andrew Lim: Ant Colony Optimization for the Ship Berthing Problem. ASIAN 1999 : 359-370 Andrew Lim, Jennifer Lai-Pheng Kwan , Wee-Chong Oon : Page Access Scheduling in Join Processing. CIKM 1999 : 276-283 Chi-Hung Chi , Chen Ding , Andrew Lim: Word Segmentation and Recognition for Web Document Framework. CIKM 1999 : 458-465 Ang Juay Chin , Ho Wee Kit , Andrew Lim: A New GA Approach for the Vehicle Routing Problem. ICTAI 1999 : 307-310 Andrew Lim: An Effective Ship Berthing Algorithm. IJCAI 1999 : 594-599 Andrew Lim: Minimum Area Joining of k Compacted Cells. Inf. Process. Lett. 58 (6): 265-269 (1996) Andrew Lim, Sartaj Sahni : Segmented Winner Trees. Elektronische Informationsverarbeitung und Kybernetik 30 (1): 29-43 (1994) Andrew Lim, Siu-Wing Cheng , Ching-Ting Wu : Performance Oriented Rectilinear Steiner Trees. DAC 1993 : 171-176 Siu-Wing Cheng , Andrew Lim, Ching-Ting Wu : Optimal Rectilinear Steiner Tree for Extremal Point Sets. ISAAC 1993 : 523-532 Andrew Lim, Siu-Wing Cheng , Sartaj Sahni : Optimal Joining of Compacted Cells. IEEE Trans. Computers 42 (5): 597-607 (1993) Andrew Lim, Yeow Meng Chee , Siu-Wing Cheng : Single Jog Minimum Area Joining of Compacted Cells. Inf. Process. Lett. 47 (4): 167-172 (1993) WingNing Li , Andrew Lim, Prathima Agrawal , Sartaj Sahni : On the Circuit Implementation Problem. DAC 1992 : 478-483 Siu-Wing Cheng , Hsi-Chuan Chen , David Hung-Chang Du , Andrew Lim: The Role of Long and Short Paths in Circuit Performance Optimization. DAC 1992 : 543-548 Yeow Meng Chee , Andrew Lim: A Complex Approach to the Security of Statistical Databases Subject to Off-line Sum Queries. SEC 1992 : 373-384 Yeow Meng Chee , Andrew Lim: The Algorithmic Complexity of Colour Switching. Inf. Process. Lett. 43 (2): 63-68 (1992) Ching-Ting Wu , Andrew Lim, David Hung-Chang Du : Wafer Packing for Full Mask Exposure Fabrication. ICCAD 1991 : 52-55 1 [ 5 ] 2 [ 25 ] [ 40 ] [ 42 ] 3 [ 2 ] [ 3 ] [ 6 ] 4 [ 4 ] 5 [ 37 ] [ 41 ] [ 51 ] [ 52 ] 6 [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] 7 [ 14 ] [ 22 ] 8 [ 21 ] 9 [ 19 ] 10 [ 13 ] [ 24 ] 11 [ 22 ] 12 [ 14 ] 13 [ 58 ] 14 [ 1 ] [ 4 ] 15 [ 20 ] [ 37 ] [ 41 ] [ 51 ] [ 52 ] 16 [ 17 ] [ 18 ] [ 43 ] 17 [ 56 ] [ 57 ] 18 [ 48 ] 19 [ 25 ] [ 28 ] [ 30 ] [ 40 ] [ 42 ] 20 [ 49 ] [ 55 ] [ 61 ] 21 [ 13 ] [ 24 ] 22 [ 56 ] 23 [ 15 ] [ 26 ] 24 [ 16 ] [ 23 ] 25 [ 29 ] [ 33 ] [ 46 ] 26 [ 5 ] 27 [ 57 ] 28 [ 23 ] 29 [ 44 ] 30 [ 15 ] [ 24 ] [ 26 ] [ 28 ] [ 32 ] [ 34 ] [ 39 ] [ 40 ] [ 42 ] 31 [ 31 ] [ 32 ] [ 44 ] 32 [ 35 ] [ 36 ] [ 38 ] [ 43 ] [ 45 ] [ 46 ] [ 47 ] [ 48 ] [ 50 ] [ 51 ] [ 52 ] [ 54 ] [ 58 ] [ 59 ] 33 [ 5 ] [ 7 ] [ 10 ] 34 [ 45 ] 35 [ 38 ] 36 [ 16 ] 37 [ 56 ] [ 57 ] 38 [ 1 ] [ 8 ] [ 9 ] 39 [ 21 ] 40 [ 35 ] [ 36 ] [ 38 ] [ 47 ] [ 54 ] [ 59 ] 41 [ 53 ] 42 [ 27 ] 43 [ 35 ] 44 [ 31 ] [ 36 ] [ 50 ] [ 58 ] [ 60 ] ![]() ©2004 Association for Computing Machinery |