Search alternatives:
harding function » hardening function (Expand Search), hearing functions (Expand Search), varying functions (Expand Search)
python function » protein function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
harding function » hardening function (Expand Search), hearing functions (Expand Search), varying functions (Expand Search)
python function » protein function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
-
121
-
122
-
123
-
124
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. …”
-
125
Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic
Published 2019“…With these practical rules, simple summation algorithms provide sufficiently robust results for the calculation of the density function and its definite integrals. …”
-
126
Flowchart of proposed algorithm.
Published 2025“…Moreover, the proposed algorithm significantly extends network lifetime, with a <b>3.5%</b> and <b>7.5%</b> improvement over EAPS-AODV and AODV. …”
-
127
-
128
Flowchart of DAPF-RRT algorithm.
Published 2025“…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
-
129
Performance comparison of different algorithms.
Published 2025“…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
-
130
-
131
-
132
-
133
Assessing binding site representation across dense arrays.
Published 2024Subjects: “…unlike approximation algorithms…”
-
134
-
135
-
136
-
137
Formulation of the nucleotide String Packing Problem (SPP) as an Orienteering Problem (OP).
Published 2024Subjects: “…unlike approximation algorithms…”
-
138
Modifying the linear integer programming model objective to include a position bias for activator sites and repressor sites.
Published 2024Subjects: “…unlike approximation algorithms…”
-
139
A minor modification to the model fosters a diverse representation of binding sites as solutions are returned.
Published 2024Subjects: “…unlike approximation algorithms…”
-
140
Stipulating positional constraints to design bacterial promoters.
Published 2024Subjects: “…unlike approximation algorithms…”