The traffic flow distribution diagram when traffic lights in both entrance and exit of the short-distance road section are red. by Yulin Tian (1457986)

The traffic flow distribution diagram when traffic lights in both entrance and exit of the short-distance road section are green. by Yulin Tian (1457986)

Flowchart for Algorithm 1. by Sagvan Y. Musa (17797611)

Flowchart for Algorithm 2. by Sagvan Y. Musa (17797611)

Algorithm of the brightness scale calibration experiment. by Krzysztof Petelczyc (3954203)

“…<p>In the algorithm, the following variables were used: “I” denotes the current luminous intensity of the reference diode, “inc” denotes the current difference between reference and target diode luminous intensity; “cnt” is the current number of performed trials, while “correct” is a counter of correct answers in cnt trials, both of them are counted separately for every settings of I and inc. …”

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. …”

PathOlOgics_RBCs Python Scripts.zip by Ahmed Elsafty (16943883)

Multi-algorithm comparison figure. 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. …”

Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy by Yujin Wu (2901128)

“…We also describe a novel hybrid searching algorithm that combines both molecular dynamics (MD)-based simulated annealing and genetic algorithm crossovers to address the enhanced sampling of the increased search space. …”

Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy by Yujin Wu (2901128)

“…We also describe a novel hybrid searching algorithm that combines both molecular dynamics (MD)-based simulated annealing and genetic algorithm crossovers to address the enhanced sampling of the increased search space. …”

A Genetic Algorithm Approach for Compact Wave Function Representations in Spin-Adapted Bases by Maru Song (22593561)

“…Crucially, we propose fitness functions based on approximate measures of the wave function compactness, which enable inexpensive genetic algorithm searches. …”

Friedman test average rankings of IFOX and competing optimization algorithms across CL, C17, C19, C21, C22, and RWPs. The “Position” column indicates the overall rank based on the... by Mahmood A. Jumaah (22272371)

The benchmark functions. by Shuhui Yu (1535500)

Comparison of deconvolution and optimization algorithms on a batch of data. by Ali-Kemal Aydin (10968731)

“…Output is given by the vascular response, measured as the change in speed of red blood cells flowing inside a capillary proximal to the recorded neuronal activation (in yellow, right panel). Both experimental data have been resampled at 50ms and used to compute a set of TFs (in orange) either with direct deconvolution approaches (Fourier or Toeplitz methods, middle-upper panel TFs) or with 1-Γ function optimization performed by 3 different algorithms (middle-lower panel TFs). …”

Algorithm detection steps. by José M. Rivera-Arbeláez (12418512)

Completion times for different algorithms. by Jianbin Zheng (587000)

“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”

The average cumulative reward of algorithms. by Jianbin Zheng (587000)

“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”

Both Ankle fNIRS MI dataset by Hammad Gilani (8060012)

“…<p><br></p><p dir="ltr">This dataset contains functional near-infrared spectroscopy (fNIRS) signals recorded during motor imagery (MI) tasks of lower limb movements. …”