The pseudocode for the NAFPSO algorithm. by Huichao Guo (14515171)

“…In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. 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)

“…In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. 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)

“…In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. 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)

“…In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. 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. …”

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

Subjects:

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

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

Parameters of the proposed algorithm. by Heba Askr (15572851)

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:

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

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

Subjects:

Venn diagrams showing overlap of the total of overrepresented/underrepresented kinases for both cohorts. by Erica A. K. DePasquale (11851483)

Subjects:

Results of proposed algorithms and algorithms in [9] for 18 instances. by Jin Zhang (53297)

Convergence curves of different algorithms on the benchmark functions. by Aihua Guo (13267712)

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)

The comparison results of all algorithms over 30 functions. by Adel Saad Assiri (9962517)

Subjects: “…Butterfly Optimization Algorithm…”

The comparison results of all algorithms over 30 functions. by Adel Saad Assiri (9962517)

Subjects: “…Butterfly Optimization Algorithm…”

A hybrid algorithm based on improved threshold function and wavelet transform. by Bingbing Li (461702)

Subjects: