Prudence W. H. Wong

Orcid: 0000-0001-7935-7245

Affiliations:
  • University of Liverpool, UK


According to our database1, Prudence W. H. Wong authored at least 105 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Towards Optimal Grammars for RNA Structures.
Proceedings of the Data Compression Conference, 2024

2023
Continual Graph Learning: A Survey.
CoRR, 2023

The Power of Amortization on Scheduling with Explorable Uncertainty.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

GOSPA-Driven Gaussian Bernoulli Sensor Management.
Proceedings of the 26th International Conference on Information Fusion, 2023

RNA secondary structures: from ab initio prediction to better compression, and back.
Proceedings of the Data Compression Conference, 2023

2021
Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs.
Theory Comput. Syst., 2021

Real-Time Characteristics Identification for Partial Shaded Photovoltaic Strings.
Proceedings of the 18th International SoC Design Conference, 2021

Can AI Teach Humans? Humans AI Collaboration for Lifelong Machine Learning.
Proceedings of the DSIT 2021: 4th International Conference on Data Science and Information Technology, Shanghai, China, July 23, 2021

Lifelong Machine Learning-Based Quality Analysis for Product Review.
Proceedings of the AISS 2021: 3rd International Conference on Advanced Information Science and System, Sanya, China, November 26, 2021

2020
Optimizing mmWave Wireless Backhaul Scheduling.
IEEE Trans. Mob. Comput., 2020

Semiglobal Sequence Alignment with Gaps Using GPU.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Lifelong Machine Learning Architecture for Classification.
Symmetry, 2020

Profit Maximization in Flex-Grid All-Optical Networks.
Theory Comput. Syst., 2020

Dynamic programming optimization in line of sight networks.
Inf. Comput., 2020

Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization.
Algorithmica, 2020

2019
Complexity and online algorithms for minimum skyline coloring of intervals.
Theor. Comput. Sci., 2019

Station Assignment with Reallocation.
Algorithmica, 2019

Performing Partially Ordered Sets of Jobs on a MAC in Presence of Adversarial Crashes.
Proceedings of the 18th IEEE International Symposium on Network Computing and Applications, 2019

Testing Methods to Minimise Range-shifting Time with Conservation Actions.
Proceedings of the 11th International Conference on Bioinformatics and Biomedical Technology, 2019

Semi-Unsupervised Lifelong Learning for Sentiment Classification: Less Manual Data Annotation and More Self-Studying.
Proceedings of the 2019 3rd High Performance Computing and Cluster Technologies Conference (HPCCT 2019) and of the 2nd International Conference on Big Data and Artificial Intelligence (BDAI 2019), Guangzhou, China, June 22, 2019

Fault-Tolerant Parallel Scheduling of Arbitrary Length Jobs on a Shared Channel.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
Scheduling Dynamic Parallel Workload of Mobile Devices with Access Guarantees.
ACM Trans. Parallel Comput., 2018

Hardness and approximation of the asynchronous border minimization problem.
Discret. Appl. Math., 2018

Estimating Invasion Time in Real Landscapes.
Proceedings of the 2nd International Conference on Computational Biology and Bioinformatics, 2018

Lifelong Machine Learning: Outlook and Direction.
Proceedings of the 2nd International Conference on Big Data Research, 2018

2017
Hierarchical Meta-Learning in Time Series Forecasting for Improved Interference-Less Machine Learning.
Symmetry, 2017

Fault tolerant scheduling of tasks of two sizes under resource augmentation.
J. Sched., 2017

Online Regenerator Placement.
Theory Comput. Syst., 2017

The Impact of Landscape Sparsification on Modelling and Analysis of the Invasion Process.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Designing an Optimal Water Quality Monitoring Network.
Proceedings of the Intelligence Science I, 2017

An Improved Abstract GPU Model with Data Transfer.
Proceedings of the 46th International Conference on Parallel Processing Workshops, 2017

Lightweight Framework for Reliable Job Scheduling in Heterogeneous Clouds.
Proceedings of the 26th International Conference on Computer Communication and Networks, 2017

Lightweight Robust Framework for Workload Scheduling in Clouds.
Proceedings of the IEEE International Conference on Edge Computing, 2017

Independent Sets in Restricted Line of Sight Networks.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
Routing in Geometric Networks.
Encyclopedia of Algorithms, 2016

Scheduling for electricity cost in a smart grid.
J. Sched., 2016

On-line maximum matching in complete multi-partite graphs with an application to optical networks.
Discret. Appl. Math., 2016

Optimal Nonpreemptive Scheduling in a Smart Grid Model.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
Optimizing busy time on parallel machines.
Theor. Comput. Sci., 2015

Fundamentals of Computation Theory.
Theor. Comput. Sci., 2015

Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines.
J. Comb. Optim., 2015

Station Assignment with Reallocation.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Pairwise Sequence Alignment with Gaps with GPU.
Proceedings of the 2015 IEEE International Conference on Cluster Computing, 2015

2014
Online optimization of busy time on parallel machines.
Theor. Comput. Sci., 2014

Statistical Discriminability Estimation for Pattern Classification Based on Neural Incremental Attribute Learning.
Int. J. Appl. Evol. Comput., 2014

A Framework for Brand Reputation Mining and Visualisation.
Proceedings of the Research and Development in Intelligent Systems XXXI, 2014

2013
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time.
Theor. Comput. Sci., 2013

Parameter Estimation of Photovoltaic Models via Cuckoo Search.
J. Appl. Math., 2013

Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy.
Algorithmica, 2013

DEM: Direct Estimation Method for Photovoltaic Maximum Power Point Tracking.
Proceedings of the First International Conference on Information Technology and Quantitative Management, 2013

Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Station Assignment with Applications to Sensing.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Improved multi-processor scheduling for flow time and energy.
J. Sched., 2012

A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time".
Inf. Process. Lett., 2012

Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines.
Proceedings of the Theory and Applications of Models of Computation, 2012

Online Optimization of Busy Time on Parallel Machines - (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2012

Hardness and Approximation of the Asynchronous Border Minimization Problem - (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2012

Insight of Direct Search Methods and Module-Integrated Algorithms for Maximum Power Point Tracking (MPPT) of Stand-Alone Photovoltaic Systems.
Proceedings of the Network and Parallel Computing, 9th IFIP International Conference, 2012

An 8/3 Lower Bound for Online Dynamic Bin Packing.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Maximum Power Point Tracking (MPPT) via Weightless Swarm Algorithm (WSA) on cloudy days.
Proceedings of the IEEE Asia Pacific Conference on Circuits and Systems, 2012

2010
Deadline scheduling and power management for speed bounded processors.
Theor. Comput. Sci., 2010

Optimal on-line colorings for minimizing the number of ADMs in optical networks.
J. Discrete Algorithms, 2010

Hardness and Approximation of The Asynchronous Border Minimization Problem
CoRR, 2010

2009
Optimizing throughput and energy in online deadline scheduling.
ACM Trans. Algorithms, 2009

On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis.
Algorithmica, 2009

Competitive Multi-dimensional Dynamic Bin Packing via L-Shape Bin Packing.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology.
Proceedings of the Structural Information and Communication Complexity, 2009

Sleep with Guilt and Work Faster to Minimize Flow Plus Energy.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Routing in Geometric Networks.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Nonmigratory Multiprocessor Scheduling for Response Time and Energy.
IEEE Trans. Parallel Distributed Syst., 2008

Dynamic bin packing of unit fractions items.
Theor. Comput. Sci., 2008

Improved on-line broadcast scheduling with deadlines.
J. Sched., 2008

Non-overlapping Common Substrings Allowing Mutations.
Math. Comput. Sci., 2008

Approximating Border Length for DNA Microarray Synthesis.
Proceedings of the Theory and Applications of Models of Computation, 2008

Competitive non-migratory scheduling for flow time and energy.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.
Proceedings of the Algorithms, 2008

2007
Routing of single-source and multiple-source queries in static sensor networks.
J. Discrete Algorithms, 2007

Online Deadline Scheduling with Bounded Energy Efficiency.
Proceedings of the Theory and Applications of Models of Computation, 2007

Energy efficient online deadline scheduling.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Energy Efficient Deadline Scheduling in Two Processor Systems.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Efficiency of Data Distribution in BitTorrent-Like Systems.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling.
Theor. Comput. Sci., 2006

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time.
J. Comb. Optim., 2006

Efficient Probe Selection in Microarray Design.
Proceedings of the 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2006

2005
On-line Stream Merging with Max Span and Min Coverage.
Theory Comput. Syst., 2005

Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.
J. Bioinform. Comput. Biol., 2005

Filtering of Ineffective siRNAs and Improved siRNA Design Tool.
Bioinform., 2005

The mutated subsequence problem and locating conserved genes.
Bioinform., 2005

Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
Aggressive Online Deadline Scheduling.
Proceedings of Computing: The Australasian Theory Symposium, 2004

An efficient algorithm for optimizing whole genome alignment with noise.
Bioinform., 2004

On-Line Windows Scheduling of Temporary Items.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

2003
On-line stream merging in a general setting.
Theor. Comput. Sci., 2003

Efficient Algorithms for Optimizing Whole Genome Alignment with Noise.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

2002
On-line load balancing of temporary tasks revisited.
Theor. Comput. Sci., 2002

A unified analysis of hot video schedulers.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Competitive Analysis of On-line Stream Merging Algorithms.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
An 5-competitive on-line scheduler for merging video streams.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Improved On-Line Stream Merging: From a Restricted to a General Setting.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

1999
On-Line Load Balancing of Temporary Tasks Revisited.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999


  Loading...