Search alternatives:
algorithm from » algorithm flow (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm etc (Expand Search), algorithm co (Expand Search)
from function » from functional (Expand Search), fc function (Expand Search)
both function » body function (Expand Search), growth function (Expand Search), beach function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), i function (Expand Search)
algorithm from » algorithm flow (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm etc (Expand Search), algorithm co (Expand Search)
from function » from functional (Expand Search), fc function (Expand Search)
both function » body function (Expand Search), growth function (Expand Search), beach function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), i function (Expand Search)
-
1
-
2
-
3
-
4
If datasets are small and/or noisy, linear-regression-based algorithms for identifying functional groups outperform more complex versions.
Published 2024“…The panels highlight that the task of identifying a predictive coarsening of an ecosystem (B) is distinct from the task of predicting the function well (A), and for small or noisy datasets, the former is best accomplished by a simpler method. …”
-
5
-
6
Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional
Published 2025“…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. …”
-
7
-
8
-
9
-
10
Linear-regression-based algorithms succeed at identifying the correct functional groups in synthetic data, and multi-group algorithms recover more information.
Published 2024“…<p>(A), (B) Algorithm performance, evaluated over 50 simulated datasets generated as described in <a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1012590#pcbi.1012590.g001" target="_blank">Fig 1</a> with <i>N</i> = 3 true groups, 900 samples and 10% simulated measurement noise. …”
-
11
-
12
-
13
CEC2017 basic functions.
Published 2025“…Specifically, it achieves faster iteration speeds across four different environments, with the planned path length after escaping local optima being shortened by an average of 7.55175 m (16.291%) compared to other optimization algorithms. These results confirm OP-ZOA’s enhanced optimization capability, significantly improving both escape efficiency from local optima and solution reliability.…”
-
14
-
15
AUC scores of anomaly detection algorithms.
Published 2025“…Empirical evaluations conducted on multiple benchmark datasets demonstrate that the proposed method outperforms classical anomaly detection algorithms while surpassing conventional model averaging techniques based on minimizing standard loss functions. …”
-
16
Recall scores of anomaly detection algorithms.
Published 2025“…Empirical evaluations conducted on multiple benchmark datasets demonstrate that the proposed method outperforms classical anomaly detection algorithms while surpassing conventional model averaging techniques based on minimizing standard loss functions. …”
-
17
-
18
-
19
-
20
CEC2017 test function test results.
Published 2025“…Specifically, it achieves faster iteration speeds across four different environments, with the planned path length after escaping local optima being shortened by an average of 7.55175 m (16.291%) compared to other optimization algorithms. These results confirm OP-ZOA’s enhanced optimization capability, significantly improving both escape efficiency from local optima and solution reliability.…”