Search alternatives:
algorithm harding » algorithm using (Expand Search), algorithm machine (Expand Search), algorithm showing (Expand Search)
harding function » hardening function (Expand Search), hearing functions (Expand Search), varying functions (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
algorithm harding » algorithm using (Expand Search), algorithm machine (Expand Search), algorithm showing (Expand Search)
harding function » hardening function (Expand Search), hearing functions (Expand Search), varying functions (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
-
1
A hybrid algorithm based on improved threshold function and wavelet transform.
Published 2024Subjects: -
2
Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results
Published 2025Subjects: -
3
-
4
Performance of the greedy approximation algorithm.
Published 2024Subjects: “…unlike approximation algorithms…”
-
5
Python implementation of the Trajectory Adaptive Multilevel Sampling algorithm for rare events and improvements
Published 2021“…<div>This directory contains Python 3 scripts implementing the Trajectory Adaptive Multilevel Sampling algorithm (TAMS), a variant of Adaptive Multilevel Splitting (AMS), for the study of rare events. …”
-
6
<b>Opti2Phase</b>: Python scripts for two-stage focal reducer
Published 2025“…</p><p dir="ltr">The package includes:</p><ul><li>Scripts for first-order analysis, third-order modeling, optimization using a Physically Grounded Merit Function (PGMF), and RMS-based refinement.</li><li>A subfolder named <b>Images</b>, which stores the figures generated by six of the seven provided scripts.…”
-
7
-
8
Frequency of binding site usage as a function of binding site length.
Published 2024Subjects: “…unlike approximation algorithms…”
-
9
500 <i>ϕ</i> vectors learned from hard thresholding.
Published 2023“…Traditionally, to replicate such biological sparsity, generative models have been using the <i>ℓ</i><sub>1</sub> norm as a penalty due to its convexity, which makes it amenable to fast and simple algorithmic solvers. In this work, we use biological vision as a test-bed and show that the soft thresholding operation associated to the use of the <i>ℓ</i><sub>1</sub> norm is highly suboptimal compared to other functions suited to approximating <i>ℓ</i><sub><i>p</i></sub> with 0 ≤ <i>p</i> < 1 (including recently proposed continuous exact relaxations), in terms of performance. …”
-
10
-
11
-
12
-
13
-
14
-
15
-
16
-
17
-
18
Box plot of the algorithms based on 12 benchmark functions.
Published 2023“…<p>Box plot of the algorithms based on 12 benchmark functions.</p>…”
-
19
Convergence behavior of the algorithms based on 12 benchmark functions.
Published 2023“…<p>Convergence behavior of the algorithms based on 12 benchmark functions.</p>…”
-
20