Search alternatives:
algorithm which » algorithm where (Expand Search), algorithm within (Expand Search)
which function » beach function (Expand Search)
algorithm 1 » algorithm _ (Expand Search), algorithms _ (Expand Search), algorithm 8217 (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
1 function » _ function (Expand Search)
a function » _ function (Expand Search)
algorithm which » algorithm where (Expand Search), algorithm within (Expand Search)
which function » beach function (Expand Search)
algorithm 1 » algorithm _ (Expand Search), algorithms _ (Expand Search), algorithm 8217 (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
1 function » _ function (Expand Search)
a function » _ function (Expand Search)
-
1
-
2
The ALO algorithm optimization flowchart.
Published 2024“…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”
-
3
The IALO algorithm solution flowchart.
Published 2024“…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”
-
4
Efficient algorithms to discover alterations with complementary functional association in cancer
Published 2019“…We provide analytic evidence of the effectiveness of UNCOVER in finding high-quality solutions and show experimentally that UNCOVER finds sets of alterations significantly associated with functional targets in a variety of scenarios. In particular, we show that our algorithms find sets which are better than the ones obtained by the state-of-the-art method, even when sets are evaluated using the statistical score employed by the latter. …”
-
5
Continuous Probability Distributions generated by the PIPE Algorithm
Published 2022“…<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. …”
-
6
23 benchmark functions.
Published 2025“…To enhance the algorithm’s global optimization capabilities and stability, an enhanced CTCM (CTCMKT) is proposed, which integrates a joint strategy of Kent chaotic mapping and <i>t</i>- distribution mutation. …”
-
7
-
8
Hyperparameter settings of the algorithm 1.
Published 2024“…Therefore, this paper presents a novel adaptive control structure for the Twin Delayed Deep Deterministic Policy Gradient algorithm, which is based on a reference trajectory model (TD3-RTM). …”
-
9
Algorithmic assessment reveals functional implications of GABRD gene variants linked to idiopathic generalized epilepsy
Published 2024“…</p> <p>The study employs a combination of in silico algorithms to analyze 82 variants of unknown clinical significance of GABRD gene sourced from the ClinVar database. …”
-
10
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. …”
-
11
ANOVA tests for Benchmark functions.
Published 2025“…To enhance the algorithm’s global optimization capabilities and stability, an enhanced CTCM (CTCMKT) is proposed, which integrates a joint strategy of Kent chaotic mapping and <i>t</i>- distribution mutation. …”
-
12
The Wilcoxon results for Benchmark functions.
Published 2025“…To enhance the algorithm’s global optimization capabilities and stability, an enhanced CTCM (CTCMKT) is proposed, which integrates a joint strategy of Kent chaotic mapping and <i>t</i>- distribution mutation. …”
-
13
Convergence graphs of Benchmark functions.
Published 2025“…To enhance the algorithm’s global optimization capabilities and stability, an enhanced CTCM (CTCMKT) is proposed, which integrates a joint strategy of Kent chaotic mapping and <i>t</i>- distribution mutation. …”
-
14
-
15
-
16
-
17
CEC2019 benchmark functions.
Published 2023“…Secondly, the nonlinear convergence factor is constructed to replace the original random factor <i>c</i><sub>1</sub> to coordinate the algorithm’s local exploitation and global exploration performance, which effectively improves the ability of the algorithm to escape extreme values and fast convergence. …”
-
18
-
19
-
20