بدائل البحث:
algorithm api » algorithm ai (توسيع البحث), algorithm i (توسيع البحث), algorithm maml (توسيع البحث)
algorithm pre » algorithm where (توسيع البحث), algorithm used (توسيع البحث), algorithm from (توسيع البحث)
api function » i function (توسيع البحث), adl function (توسيع البحث), gi function (توسيع البحث)
pre function » spread function (توسيع البحث), sphere function (توسيع البحث), three function (توسيع البحث)
algorithm a » algorithm _ (توسيع البحث), algorithm b (توسيع البحث), algorithms _ (توسيع البحث)
a function » _ function (توسيع البحث)
algorithm api » algorithm ai (توسيع البحث), algorithm i (توسيع البحث), algorithm maml (توسيع البحث)
algorithm pre » algorithm where (توسيع البحث), algorithm used (توسيع البحث), algorithm from (توسيع البحث)
api function » i function (توسيع البحث), adl function (توسيع البحث), gi function (توسيع البحث)
pre function » spread function (توسيع البحث), sphere function (توسيع البحث), three function (توسيع البحث)
algorithm a » algorithm _ (توسيع البحث), algorithm b (توسيع البحث), algorithms _ (توسيع البحث)
a function » _ function (توسيع البحث)
-
1
Comparison of deconvolution and optimization algorithms on a batch of data.
منشور في 2021"…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). …"
-
2
Prediction performance of different optimization algorithms.
منشور في 2021"…<p>(A) 3 algorithms were compared in terms of the residuals of the cost function of the optimized TF on 7 mice datasets (Derivative free algorithm failed in optimizing a TF in a mouse). …"
-
3
-
4
-
5
-
6
-
7
-
8
Feature selection algorithm.
منشور في 2023"…Our analysis pipeline included pre-processing steps, feature extraction from both time and frequency domains, a voting algorithm for selecting features, and model training and validation. …"
-
9
-
10
-
11
As for Fig 2, we present failure rates as a function of the cohort size (vertical axis) versus the number of distractors (horizontal axis), for the Smyth and McClave baseline algorithm from [76].
منشور في 2020"…We note that the middle row is a special case: here, <i>f</i><sub>target</sub> only corresponds to the proportions of the embedded cohort, while “success” for these two panels is defined as recovering maximally diverse cohorts, as this particular algorithm is designed to do. …"
-
12
-
13
-
14
Features selected by optimization algorithms.
منشور في 2024"…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …"
-
15
-
16
-
17
Modeling Molecularly Imprinted Nanoparticles with LNKD: A Resource Efficient Algorithm for Polymer Cross-Linking
منشور في 2025"…Here, we propose LNKD (Linking Nodes in KD-trees), a resource-efficient algorithm for predicting pairs of reactive atoms in pre-cross-linked 3D structures of monomers that applies not only to the modeling of MIPs, but also chemical cross-linking in other materials. …"
-
18
Hybrid feature selection algorithm of CSCO-ROA.
منشور في 2024"…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …"
-
19
-
20