Comparison of algorithms in two cases. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

Flow of the NSGA-II algorithm. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

The optimal solution set of NYN by using different algorithms. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

The optimal solution set of HN by using different algorithms. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

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

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

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

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

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

Reward function related parameters. by Honglei Pang (22693724)

Subjects:

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

The figures showed a comparison of the balanced and imbalanced sequences and performance of classifiers. by Solomon Shiferaw Beyene (9143178)

The benchmark functions. by Shuhui Yu (1535500)

Modular architecture design of PyNoetic showing all its constituent functions. by Gursimran Singh (575288)

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)

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