EASP-AODV algorithm for route discovery at the intermediate node. by Tibebu Legesse (21030014)

Functional enrichment and correlation analysis of hub DE-SRGs. by Xihao Shen (20347942)

Subjects:

Comparison of different algorithms. by Jiandong Qiu (20389944)

Linear-regression-based algorithms succeed at identifying the correct functional groups in synthetic data, and multi-group algorithms recover more information. by Yuanchen Zhao (12905580)

“…<p>(A), (B) Algorithm performance, evaluated over 50 simulated datasets generated as described in <a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1012590#pcbi.1012590.g001" target="_blank">Fig 1</a> with <i>N</i> = 3 true groups, 900 samples and 10% simulated measurement noise. …”

Comparison of different algorithms. by Dawei Wang (471687)

“…A sophisticated optimization model has been developed to simulate the optimal operation of machinery, aiming to maximize equipment utilization efficiency while addressing the challenges posed by worker fatigue. An innovative algorithm, the improved hybrid gray wolf and whale algorithm fused with a penalty function for construction machinery optimization (IHWGWO), is introduced, incorporating a penalty function to handle constraints effectively. …”

Decoding motor patterns as a function of word length. by Viet Chau Linh Nguyen (21601707)

“…(C) Average number of fixations in good (blue dots) and poor decoders (red dots) as a function of word length (expressed in number of characters) in both training sessions. …”

Code snippets to add user-specific custom functionality in PyNoetic. by Gursimran Singh (575288)

Subjects:

The training process for PV data. (a) Training accuracy as a function of epochs. (b) Training loss as a function of epochs. by Hiam Alquran (17636906)

The training process for AV data. (a) Training accuracy as a function of epochs. (b) Training loss as a function of epochs. by Hiam Alquran (17636906)

The training process for TV data. (a) Training accuracy as a function of epochs. (b) Training loss as a function of epochs. by Hiam Alquran (17636906)

The training process for MV data. (a) Training accuracy as a function of epochs. (b) Training loss as a function of epochs. by Hiam Alquran (17636906)

The benchmark functions. by Shuhui Yu (1535500)

Study proposed algorithm. by Ainhoa Pérez-Guerrero (21377457)

“…The index of microvascular resistance (IMR) is a specific physiological parameter used to assess microvascular function. Invasive coronary assessment has been shown to be both feasible and safe. …”

Overview of archaic SNPs (aSNPs) potentially affecting G4 formation, identified by G4SNVHunter. by Rongxin Zhang (1618159)

A hypothetical example illustrating the differences between the two assessment modes in G4SNVHunter. by Rongxin Zhang (1618159)

Gillespie algorithm simulation parameters. by Nicholas H. Vitale (20469289)

“…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …”

Scheduling time of five algorithms. by Huichao Guo (14515171)

“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

Convergence speed of five algorithms. by Huichao Guo (14515171)

“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

The accuracy of different algorithms for TMD on SHL and HTC datasets. by Rui Li (4631)

Overnight technician routing and scheduling problem with time windows and balanced workloads: a bi-objective zebra optimization algorithm by Abolfazl Gharaei (21803416)

“…</p> <p><b>Highlights</b></p><p>An ML-based bi-objective zebra optimisation algorithm to treat large-scale TRSPs</p><p>Centroid-based clustering on the population of zebras to avoid bias towards a specific search space</p><p>Making a trade-off between exploration and exploitation of the feasible region in the developed algorithm</p><p>A new MINLP model of a weighted bi-objective TRSP with limited capacity depots</p><p>Workload function, penalty function for lateness, subcontracts, time windows for tasks and breaks</p><p>Experiments using real data to show the performance of the model and solution method</p><p></p> <p>An ML-based bi-objective zebra optimisation algorithm to treat large-scale TRSPs</p> <p>Centroid-based clustering on the population of zebras to avoid bias towards a specific search space</p> <p>Making a trade-off between exploration and exploitation of the feasible region in the developed algorithm</p> <p>A new MINLP model of a weighted bi-objective TRSP with limited capacity depots</p> <p>Workload function, penalty function for lateness, subcontracts, time windows for tasks and breaks</p> <p>Experiments using real data to show the performance of the model and solution method</p>…”