Search Results - "Wong, Prudence W.H."

Parameter Estimation of Photovoltaic Models via Cuckoo Search by Ma, Jieming, Ting, T. O., Man, Ka Lok, Zhang, Nan, Guan, Sheng-Uei, Wong, Prudence W. H.

“…Since conventional methods are incapable of estimating the parameters of Photovoltaic (PV) models with high accuracy, bioinspired algorithms have attracted…”
Get full text

Parameter estimation of photovoltaic model via parallel particle swarm optimization algorithm by Ma, Jieming, Man, Ka Lok, Guan, Sheng-Uei, Ting, T. O., Wong, Prudence W. H.

“…Summary Recently, bio‐inspired metaheuristic algorithms have been widely used as powerful optimization tools to estimate crucial parameters of photovoltaic…”
Get full text

Lifelong Machine Learning Architecture for Classification by Hong, Xianbin, Guan, Sheng-Uei, Man, Ka Lok, Wong, Prudence W. H.

“…Benefiting from the rapid development of big data and high-performance computing, more data is available and more tasks could be solved by machine learning…”
Get full text

Designing an Optimized Water Quality Monitoring Network with Reserved Monitoring Locations by Xiaohui Zhu, Yong Yue, Prudence W.H. Wong, Yixin Zhang, Hao Ding

“…The optimized design of water quality monitoring networks can not only minimize the pollution detection time and maximize the detection probability for river…”
Get full text

Approximate Single-Diode Photovoltaic Model for Efficient I-V Characteristics Estimation by Wong, Prudence W. H., Guan, Sheng-Uei, Zhang, Nan, Ting, T. O., Man, Ka Lok, Ma, Jieming

“…Precise photovoltaic (PV) behavior models are normally described by nonlinear analytical equations. To solve such equations, it is necessary to use iterative…”
Get full text

Outlook and Direction of AI Tour Guide Services - from the Lifelong Machine Learning View by Wang, Shuai, Hong, Xianbin, Karia, Noorliza, Guan, Sheng-Uei, Wong, Prudence W.H., Man, Ka Lok, Liu, Dawei

“…Artificial intelligence (AI) has entered tourism and become a new service in a tour guide. AI technology can help tourism by providing customized services and…”
Get full text

On-line Stream Merging with Max Span and Min Coverage by Chan, Wun-Tat, Lam, Tak-Wah, Ting, Hing-Fung, Wong, Prudence W.H.

“…This paper introduces the notions of span and coverage for analyzing the performance of on-line algorithms for stream merging. It is shown that these two…”
Get full text

Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization by Liu, Fu-Hong, Liu, Hsiang-Hsuan, Wong, Prudence W. H.

“…We study a scheduling problem arising in demand response management in smart grid. Consumers send in power requests with a flexible feasible time interval…”
Get full text

Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines by Bell, Paul C., Wong, Prudence W. H.

“…In this paper we study energy efficient deadline scheduling on multiprocessors in which the processors consumes power at a rate of s α when running at speed s…”
Get full text

Transcriptome analysis of the filamentous fungus Aspergillus nidulans directed to the global identification of promoters by Sibthorp, Christopher, Wu, Huihai, Cowley, Gwendolyn, Wong, Prudence W H, Palaima, Paulius, Morozov, Igor Y, Weedall, Gareth D, Caddick, Mark X

“…The filamentous fungus Aspergillus nidulans has been a tractable model organism for cell biology and genetics for over 60 years. It is among a large number of…”
Get full text

Online scheduling of simple linear deteriorating jobs to minimize the total general completion time by Yu, Sheng, Wong, Prudence W.H.

“…Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations in which the processing time increases…”
Get full text

Profit Maximization in Flex-Grid All-Optical Networks by Shalom, Mordechai, Wong, Prudence W. H., Zaks, Shmuel

“…All-optical networks have been largely investigated due to their high data transmission rates. The key to the high speeds in all-optical networks is to…”
Get full text

Optimizing busy time on parallel machines by Mertzios, George B., Shalom, Mordechai, Voloshin, Ariella, Wong, Prudence W.H., Zaks, Shmuel

“…We consider the following fundamental parallel machines scheduling problem in which the input consists of n jobs to be scheduled on a set of identical machines…”
Get full text

An Improved Abstract GPU Model with Data Transfer by Carroll, Thomas C., Wong, Prudence W. H.

“…GPUs are commonly used as coprocessors to accelerate a compute-intensive task, thanks to their massively parallel architecture. There is study into different…”
Get full text

Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs by Liu, Fu-Hong, Liu, Hsiang-Hsuan, Wong, Prudence W. H.

“…We study online scheduling of unit-sized jobs in two related problems, namely, restricted assignment problem and smart grid problem. The input to the two…”
Get full text

Station Assignment with Reallocation by Halper, Austin, Mosteiro, Miguel A., Rossikova, Yulia, Wong, Prudence W. H.

“…We study a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static…”
Get full text

Semiglobal Sequence Alignment with Gaps Using GPU by Carroll, Thomas C., Ojiaku, Jude-Thaddeus, Wong, Prudence W.H.

“…In this paper, we consider the pair-wise semiglobal sequence alignment problem with gaps, which is motivated by the re-sequencing problem that requires to…”
Get full text

Fault tolerant scheduling of tasks of two sizes under resource augmentation by Kowalski, Dariusz R., Wong, Prudence W. H., Zavou, Elli

“…Guaranteeing the eventual execution of tasks in machines that are prone to unpredictable crashes and restarts may be challenging, but is also of high…”
Get full text

Fundamentals of Computation Theory by Gąsieniec, Leszek, Martin, Russell, Wolter, Frank, Wong, Prudence W.H.

Get full text

On-line maximum matching in complete multi-partite graphs with an application to optical networks by Shalom, Mordechai, Wong, Prudence W.H., Zaks, Shmuel

“…Finding a maximum matching in a graph is a classical problem. The on-line versions of the problem in which the vertices and/or edges of the graph are given one…”
Get full text