Search alternatives:
algorithm pre » algorithm where (Expand Search), algorithm used (Expand Search), algorithm from (Expand Search)
pre function » spread function (Expand Search), sphere function (Expand Search), three function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
algorithm 1 » algorithm _ (Expand Search), algorithms _ (Expand Search), algorithm 8217 (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), i function (Expand Search)
1 function » _ function (Expand Search), a function (Expand Search)
algorithm pre » algorithm where (Expand Search), algorithm used (Expand Search), algorithm from (Expand Search)
pre function » spread function (Expand Search), sphere function (Expand Search), three function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
algorithm 1 » algorithm _ (Expand Search), algorithms _ (Expand Search), algorithm 8217 (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), i function (Expand Search)
1 function » _ function (Expand Search), a function (Expand Search)
-
1
Prediction performance of different optimization algorithms.
Published 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). …”
-
2
-
3
-
4
-
5
-
6
-
7
-
8
Comparison of deconvolution and optimization algorithms on a batch of data.
Published 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). …”
-
9
-
10
-
11
-
12
-
13
-
14
Algorithm results based on FE simulated likelihood functions.
Published 2020“…<p>(A) Nodule depth estimation by the algorithm with the likelihood functions obtained by FEM simulation. …”
-
15
a) FO Function, b) FI function.
Published 2023“…The SRL32 primitive (Reconfigurable Look up Tables—RLUTs) and DPR (Dynamic Partial Reconfiguration) are employed to reconfigure single round MISTY1 / KASUMI algorithms on the run-time. The RLUT based architecture attains dynamic logic functionality without extra hardware resources by internally modifying the LUT contents. …”
-
16
-
17
-
18
-
19
-
20