Search alternatives:
algorithm three » algorithm where (Expand Search), algorithm pre (Expand Search)
three function » three functional (Expand Search), tree functional (Expand Search), time function (Expand Search)
based function » based functional (Expand Search), basis function (Expand Search), basis functions (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
algorithm three » algorithm where (Expand Search), algorithm pre (Expand Search)
three function » three functional (Expand Search), tree functional (Expand Search), time function (Expand Search)
based function » based functional (Expand Search), basis function (Expand Search), basis functions (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
-
1
-
2
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. …”
-
3
A hybrid algorithm based on improved threshold function and wavelet transform.
Published 2024Subjects: -
4
-
5
-
6
-
7
-
8
-
9
-
10
Comparison of algorithm search curves.
Published 2023“…<div><p>At present, the fault diagnosis of pumping units in major oil fields in China is time-consuming and inefficient, and there is no universal problem for high requirements of hardware resources. In this study, a fault fusion diagnosis method of pumping unit based on improved Fourier descriptor (IDF) and rapid density clustering RBF (RDC-RBF) neural network is proposed. …”
-
11
-
12
Pseudo-code of DMDDPG algorithm.
Published 2025“…Next, a reward function is designed by integrating the decoupled multi-agent deterministic deep deterministic policy gradient (DMDDPG) algorithm. …”
-
13
-
14
An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions
Published 2021“…<p>Many problems in statistics and machine learning can be formulated as an optimization problem of a finite sum of nonsmooth convex functions. We propose an algorithm to minimize this type of objective functions based on the idea of alternating linearization. …”
-
15
-
16
-
17
-
18
-
19
-
20