The ALO algorithm optimization flowchart. by Wenjing Wang (181404)

Subjects:

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

Subjects:

Loss function value changes in CNN training changes with epochs for both training dataset and testing dataset. by Jiaxi Wang (545353)

The image of the Aekley function. by Zhengyu Xu (8550660)

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

Subjects:

Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional by Ryan Stocks (16867476)

“…Improving algorithmic efficiency through hardware-aware implementations enables application to larger systems and more efficient generation of larger training data sets for machine-learning. …”

Standard functions to test. by Kemal Gökhan Nalbant (18858009)

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

Prediction performance of different optimization algorithms. by Ali-Kemal Aydin (10968731)

“…<p>(A) 3 algorithms were compared in terms of the residuals of the cost function of the optimized TF on 7 mice datasets (Derivative free algorithm failed in optimizing a TF in a mouse). …”

Comparison of different algorithms. by Dawei Wang (471687)

Subjects:

The benchmark functions. by Shuhui Yu (1535500)

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

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

Subjects:

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

“…In response to the multi-agent system of the H-beam riveting and welding work cell, a recurrent multi-agent proximal policy optimization algorithm (rMAPPO) is proposed to address the multi-agent scheduling problem in the H-beam processing. …”

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

“…In response to the multi-agent system of the H-beam riveting and welding work cell, a recurrent multi-agent proximal policy optimization algorithm (rMAPPO) is proposed to address the multi-agent scheduling problem in the H-beam processing. …”

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

Subjects:

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

Objective function for pressure control system. by Fazal E. Nasir (14992506)