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

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

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

Simulation settings of rMAPPO algorithm. 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). …”

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

“…We show that batched formation of the XC matrix from the density matrix yields the best performance for large (>O(103) basis functions), sparse systems such as glycine chains and water clusters. …”

Search for Correlations Between the Results of the Density Functional Theory and Hartree–Fock Calculations Using Neural Networks and Classical Machine Learning Algorithms by Saadiallakh Normatov (20682324)

Search for Correlations Between the Results of the Density Functional Theory and Hartree–Fock Calculations Using Neural Networks and Classical Machine Learning Algorithms by Saadiallakh Normatov (20682324)

Network structure diagram of YOLOv8 algorithm. by Weiyu Han (3448742)

Subjects:

If datasets are small and/or noisy, linear-regression-based algorithms for identifying functional groups outperform more complex versions. by Yuanchen Zhao (12905580)

Subjects:

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

Knowledge graph model rating function. by Chunjuan Li (7890182)

SP results of algorithms in the CEC 2009 test functions. by Vahid Goodarzimehr (21343124)

MS results of algorithms in the CEC 2009 test functions. by Vahid Goodarzimehr (21343124)

Algorithm testing. by Ziad M. Ali (12516532)

Subjects:

Algorithm pseudocode. by Cheng-jie Chen (22272090)

Subjects:

Algorithm for constructing Boot-t CIs. by Qin Gong (118801)

Subjects: “…lindley approximation algorithm…”

The benchmark functions. by Shuhui Yu (1535500)