7 citations · 7 across the 9 of their papers we have counts for
12 papers
The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
Bob Krekelberg, Alison Hsiang-Hsuan Liu, Fu-Hong Liu +2
We study online scheduling to minimize total completion time with explorable uncertainty on single and multiple machines. Each job comes with an upper limit of its processing time,…
Towards Optimal Grammars for RNA Structures
Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
In past work (Onokpasa, Wild, Wong, DCC 2023), we showed that (a) for joint compression of RNA sequence and structure, stochastic context-free grammars are the best known compresso…
RNA secondary structures: from ab initio prediction to better compression, and back
Evarista Onokpasa, Sebastian Wild, Prudence W. H. Wong
In this paper, we use the biological domain knowledge incorporated into stochastic models for ab initio RNA secondary-structure prediction to improve the state of the art in joint…
Continual Graph Learning: A Survey
Qiao Yuan, Sheng-Uei Guan, Pin Ni +4
Continual Graph Learning (CGL) enables models to incrementally learn from streaming graph-structured data without forgetting previously acquired knowledge. Experience replay is a c…
Semi-Unsupervised Lifelong Learning for Sentiment Classification: Less Manual Data Annotation and More Self-Studying
Xianbin Hong, Gautam Pal, Sheng-Uei Guan +4
Lifelong machine learning is a novel machine learning paradigm which can continually accumulate knowledge during learning. The knowledge extracting and reusing abilities enable the…
Dynamic Programming Optimization in Line of Sight Networks
Pavan Sangha, Prudence W. H. Wong, Michele Zito
Line of Sight (LoS) networks were designed to model wireless communication in settings which may contain obstacles restricting node visibility. For fixed positive integer , and…
Station Assignment with Reallocation
Austin Halper, Miguel A. Mosteiro, Yulia Rossikova +1
We study a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static stations via radio transm…
Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel
Marek Klonowski, Dariusz R. Kowalski, Jarosław Mirek +1
We study the problem of scheduling jobs on fault-prone machines communicating via a shared channel, also known as multiple-access channel. We have arbitrary length jobs to be s…
Lightweight Robust Framework for Workload Scheduling in Clouds
Muhammed Abdulazeez, Pawel Garncarek, Dariusz R. Kowalski +1
Reliability, security and stability of cloud services without sacrificing too much resources have become a desired feature in the area of workload management in clouds. The paper p…
Non-preemptive Scheduling in a Smart Grid Model and its Implications on Machine Minimization
Fu-Hong Liu, Hsiang-Hsuan Liu, Prudence W. H. Wong
We study a scheduling problem arising in demand response management in smart grid. Consumers send in power requests with a flexible feasible time interval during which their reques…
Online Regenerator Placement
George B. Mertzios, Mordechai Shalom, Prudence W. H. Wong +1
Connections between nodes in optical networks are realized by lightpaths. Due to the decay of the signal, a regenerator has to be placed on every lightpath after at most hops,…
Hardness and Approximation of The Asynchronous Border Minimization Problem
Alexandru Popa, Prudence W. H. Wong, Fencol C. C. Yung
We study a combinatorial problem arising from microarrays synthesis. The synthesis is done by a light-directed chemical process. The objective is to minimize unintended illuminatio…