Feature selection algorithm. حسب Mahmoud Zeydabadinezhad (12289570)

الموضوعات:

The pseudocode for the NAFPSO algorithm. حسب 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. حسب 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. …"

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

"…Functional groups are widely used in organic chemistry, because they provide a rationale to analyze physicochemical and reactivity properties. …"

Continuous Probability Distributions generated by the PIPE Algorithm حسب 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. …"

Algorithm detection steps. حسب José M. Rivera-Arbeláez (12418512)

Comparison of deconvolution and optimization algorithms on a batch of data. حسب Ali-Kemal Aydin (10968731)

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

Study proposed algorithm. حسب Ainhoa Pérez-Guerrero (21377457)

"…The index of microvascular resistance (IMR) is a specific physiological parameter used to assess microvascular function. …"

Flowchart for Algorithm 1. حسب Sagvan Y. Musa (17797611)

Flowchart for Algorithm 2. حسب Sagvan Y. Musa (17797611)

Completion times for different algorithms. حسب 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. حسب 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. …"

Gillespie algorithm simulation parameters. حسب Nicholas H. Vitale (20469289)

"…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …"

Scheduling time of five algorithms. حسب 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. حسب 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. …"

Summary of results of naïve Bayes algorithms. حسب Christopher E. Niemczak (8586861)

الموضوعات:

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

"…Kohn–Sham density functional theory (KS-DFT) has become a cornerstone for studying the electronic structure of molecules and materials. …"

Algorithm of the brightness scale calibration experiment. حسب Krzysztof Petelczyc (3954203)

"…<p>In the algorithm, the following variables were used: “I” denotes the current luminous intensity of the reference diode, “inc” denotes the current difference between reference and target diode luminous intensity; “cnt” is the current number of performed trials, while “correct” is a counter of correct answers in cnt trials, both of them are counted separately for every settings of I and inc. …"

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

الموضوعات:

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

الموضوعات: