- Filtering of Ine ective siRNAs and Improved siRNA Design Tool Prudence WH Wong 1 TW Lam 1 YC Mui 1 SM Yiu 1
- Dynamic Bin Packing of Unit Fractions Items Wun-Tat Chan1,
- On-line Windows Scheduling of Temporary Items
- A 5Competitive Online Scheduler for Merging Video Streams WunTat Chan TakWah Lam HingFung Ting WaiHa Wong
- Improved Online Broadcast Scheduling with Deadlines # Feifeng Zheng + Stanley P. Y. Fung # WunTat Chan Francis Y. L. Chin
- Nonmigratory Multiprocessor Scheduling for Response Time and Energy
- September 23, 2004 14:43 DRAFT VERSION jbcb-revise EFFICIENT CONSTRAINED MULTIPLE SEQUENCE
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
- Approximating Border Length for DNA Microarray Synthesis
- O#line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling
- A MutationSensitive Approach for Locating Conserved Gene Pairs between Related Species
- Competitive Non-migratory Scheduling for Flow Time and Energy
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- Deadline Scheduling and Power Management for Speed Bounded Processors
- Nonoverlapping Common Substrings Allowing H.L. Chan, T.W. Lam, W.K. Sung, Prudence Wong and S.M. Yiu
- Deadline Scheduling and Power Management for Speed Bounded Processors
- Improved Multi-processor Scheduling for Flow Time and Energy
- Optimal on-line colorings for minimizing the number of ADMs in optical networks
- Competitive Multi-Dimensional Dynamic Bin Packing via L-Shape Bin Packing
- On-line Maximum Matching in Complete Multipartite Graphs with Implications to the
- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
- Dynamic Bin Packing of Unit Fractions Items Joseph Wun-Tat Chan
- Speed Scaling Functions for Flow Time Scheduling based on Active Job Count
- Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
- Efficiency of Data Distribution in BitTorrent-Like Systems
- Efficient Probe Selection in Microarray Design Leszek G asieniec, Cindy Y. Li, Paul Sant, Prudence W.H. Wong
- A Dynamic Programming Approach of Finding an Optimal Broadcast Schedule in Minimizing Total Flow
- UNIVERSITY OF LIVERPOOL School of Biological Sciences/ Computer Sciences
- Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines
- New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling
- On-line Load Balancing of Temporary Tasks Tak-Wah Lam Hing-Fung Ting Kar-Keung To Wai-Ha Wong
- On-line Stream Merging in a General Setting Wun-Tat Chan Tak-Wah Lam y
- Optimizing Throughput and Energy in Online Deadline Scheduling
- September 17, 2004 12:8 Proceedings Trim Size: 9.75in x 6.5in apbc05 ALLOWING MISMATCHES IN ANCHORS FOR WHOLE GENOME
- Efficient Constrained Multiple Sequence Alignment with Performance Guarantee
- Energy E#cient Online Deadline Scheduling HoLeung Chan # WunTat Chan + TakWah Lam # LapKei Lee # KinSum Mak #
- On-line Stream Merging with Max Span and Min Coverage
- Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines
- Online Deadline Scheduling with Bounded Energy Efficiency
- Sleep with Guilt and Work Faster to Minimize Flow plus Energy
- Energy Efficient Deadline Scheduling in Two Processor Systems
- A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time"
- Online Regenerator Placement George B. Mertzios1
- Online Speed Scaling Based on Active Job Count to Minimize Flow plus Energy
- Optimizing Busy Time on Parallel Machines George B. Mertzios, Mordechai Shalom, Ariella Voloshin, Prudence W.H. Wong and Shmuel Zaks
