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

Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results by Se-Hee Jo (20554623)

Subjects:

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 ALO algorithm optimization flowchart. by Wenjing Wang (181404)

Subjects:

The IALO algorithm solution flowchart. by Wenjing Wang (181404)

Subjects:

The pseudocode for the NAFPSO algorithm. 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. …”

PSO algorithm flowchart. 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. …”

Comparison of different algorithms. by Dawei Wang (471687)

Subjects:

Continuous Probability Distributions generated by the PIPE Algorithm by LUIS G.B. PINHO (14073372)

“…<div><p>Abstract We investigate the use of the Probabilistic Incremental Programming Evolution (PIPE) algorithm as a tool to construct continuous cumulative distribution functions to model given data sets. …”

An expectation-maximization algorithm for finding noninvadable stationary states. by Robert Marsland (8616483)

“…<i>(c)</i> Pseudocode for self-consistently computing <b>R</b>* and , which is identical to standard expectation-maximization algorithms employed for problems with latent variables in machine learning.…”

Multi-algorithm comparison figure. by Dawei Wang (471687)

Subjects:

Solid lines present trend curves for normalized rolling algorithmic complexity and dashed lines depict the average rolling algorithmic complexity as a function of experimental cond... by Mikołaj Biesaga (17816940)

Python implementation of the Trajectory Adaptive Multilevel Sampling algorithm for rare events and improvements by Pascal Wang (10130612)

“…In `main.py`, the parameters for the TAMS algorithm are specified (trajectory time, time step, score function, number of particles, type of score threshold, maximum number of iterations, noise level etc.). …”

The run time for each algorithm in seconds. by Edward Antonian (21453161)

“…We find evidence that the generalised GLS-KGR algorithm is well-suited to such time-series applications, outperforming several standard techniques on this dataset.…”

EFGs: A Complete and Accurate Implementation of Ertl’s Functional Group Detection Algorithm in RDKit by Gonzalo Colmenarejo (650249)

“…In this paper, a new RDKit/Python implementation of the algorithm is described, that is both accurate and complete. …”

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

“…<div><p>We present a model for the noise and inherent stochasticity of fluorescence signals in both continuous wave (CW) and time-gated (TG) conditions. …”

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

Listed python codes of our algorithm with explanations (Python 3.9 recommended). by Takayuki Niizato (162226)

Feature selection algorithm. by Mahmoud Zeydabadinezhad (12289570)

“…Our analysis pipeline included pre-processing steps, feature extraction from both time and frequency domains, a voting algorithm for selecting features, and model training and validation. …”