Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search)
algorithm setup » algorithm seu (Expand Search), algorithm steps (Expand Search), algorithm etc (Expand Search)
python function » protein function (Expand Search)
setup function » step function (Expand Search), t4p function (Expand Search), cep function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
both function » body function (Expand Search), growth function (Expand Search), beach function (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search)
algorithm setup » algorithm seu (Expand Search), algorithm steps (Expand Search), algorithm etc (Expand Search)
python function » protein function (Expand Search)
setup function » step function (Expand Search), t4p function (Expand Search), cep function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
both function » body function (Expand Search), growth function (Expand Search), beach function (Expand Search)
-
101
-
102
-
103
Study proposed algorithm.
Published 2025“…The index of microvascular resistance (IMR) is a specific physiological parameter used to assess microvascular function. Invasive coronary assessment has been shown to be both feasible and safe. …”
-
104
-
105
ADT: A Generalized Algorithm and Program for Beyond Born–Oppenheimer Equations of “<i>N</i>” Dimensional Sub-Hilbert Space
Published 2020“…In order to overcome such shortcoming, we develop a generalized algorithm, “ADT” to generate the nonadiabatic equations through symbolic manipulation and to construct highly accurate diabatic surfaces for molecular processes involving excited electronic states. …”
-
106
-
107
-
108
-
109
-
110
-
111
Algorithm of the brightness scale calibration experiment.
Published 2024“…<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. …”
-
112
Gillespie algorithm simulation parameters.
Published 2024“…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …”
-
113
Scheduling time of five algorithms.
Published 2025“…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. …”
-
114
Convergence speed of five algorithms.
Published 2025“…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. …”
-
115
-
116
Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy
Published 2021“…We also describe a novel hybrid searching algorithm that combines both molecular dynamics (MD)-based simulated annealing and genetic algorithm crossovers to address the enhanced sampling of the increased search space. …”
-
117
Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy
Published 2021“…We also describe a novel hybrid searching algorithm that combines both molecular dynamics (MD)-based simulated annealing and genetic algorithm crossovers to address the enhanced sampling of the increased search space. …”
-
118
A Genetic Algorithm Approach for Compact Wave Function Representations in Spin-Adapted Bases
Published 2025“…Crucially, we propose fitness functions based on approximate measures of the wave function compactness, which enable inexpensive genetic algorithm searches. …”
-
119
-
120