Search alternatives:
where function » sphere function (Expand Search), gene function (Expand Search), wave function (Expand Search)
algorithm pre » algorithm used (Expand Search), algorithm from (Expand Search), algorithm _ (Expand Search)
pre function » spread function (Expand Search), sphere function (Expand Search), three function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), 1 function (Expand Search)
where function » sphere function (Expand Search), gene function (Expand Search), wave function (Expand Search)
algorithm pre » algorithm used (Expand Search), algorithm from (Expand Search), algorithm _ (Expand Search)
pre function » spread function (Expand Search), sphere function (Expand Search), three function (Expand Search)
algorithm b » algorithm _ (Expand Search), algorithms _ (Expand Search)
b function » _ function (Expand Search), a function (Expand Search), 1 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
<b>Opti2Phase</b>: Python scripts for two-stage focal reducer
Published 2025“…</li></ul><p dir="ltr">The scripts rely on the following Python packages. Where available, repository links are provided:</p><ol><li><b>NumPy</b>, version 1.22.1</li><li><b>SciPy</b>, version 1.7.3</li><li><b>PyGAD</b>, version 3.0.1 — https://pygad.readthedocs.io/en/latest/#</li><li><b>bees-algorithm</b>, version 1.0.2 — https://pypi.org/project/bees-algorithm</li><li><b>KrakenOS</b>, version 1.0.0.19 — https://github.com/Garchupiter/Kraken-Optical-Simulator</li><li><b>matplotlib</b>, version 3.5.2</li></ol><p dir="ltr">All scripts are modular and organized to reflect the design stages described in the manuscript.…”
-
4
-
5
Using synthetic data to test group-searching algorithms in a context where the correct grouping of species is known and uniquely defined.
Published 2024“…The reaction network is assumed to form a linear degradation chain 1 → 2 → ⋯ → <i>N</i> with the end-product concentration (metabolite <i>N</i>, orange) taken as the function of interest (shown with <i>N</i> = 3 as an example). …”
-
6
-
7
-
8
-
9
-
10
-
11
Experiment 2D and 5D: Progressive Sample Scaling Algorithm To Solve Many-Affine BBOB Functions.
Published 2024“…For this specific experiment<a href="https://markdownlivepreview.com/#cite_note-2" target="_blank"><sup>[2]</sup></a><a href="https://markdownlivepreview.com/#cite_note-3" target="_blank"><sup>[3]</sup></a>, the average AOCC is calculated.</p><p dir="ltr"><b>Objectives</b></p><ul><li>Solve Many-Affine BBOB Functions using a Deterministic Algorithm.…”
-
12
-
13
If datasets are small and/or noisy, linear-regression-based algorithms for identifying functional groups outperform more complex versions.
Published 2024“…Both versions are evaluated on the same synthetic datasets with a 3-group ground truth. Each algorithm return a set of coarsened <i>variables</i> (a grouping of species into three groups) and a <i>model</i> that uses these variables to predict the function. …”
-
14
-
15
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 algor...
Published 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. The bottom row shows the same simulations as the middle row, but presents successes and failures when the targets that generated the embedded cohort are applied instead of the balanced targets that are part of the baseline’s objective function. …”
-
16
Search-based testing (Genetic Algorithm) - Chapter 11 of the book "Software Testing Automation"
Published 2022“…</p> <pre><code># the main function</code></pre> <pre><code># 1- Instrument the input source, testfunc.…”
-
17
-
18
-
19
Brief sketch of the quasi-attraction/alignment algorithm.
Published 2023“…(D) A brief sketch of the avoidance algorithm. Upper: Each direction is extended to the repulsion area = {<b><i>r</i></b>||<b><i>r</i></b>| = <i>R</i>}, where is the minimal sphere cap that covers all points on . …”
-
20