يعرض 1 - 20 نتائج من 15,758 نتيجة بحث عن '(((( algorithm a function ) OR ( algorithm where function ))) OR ( algorithm b function ))', وقت الاستعلام: 0.69s تنقيح النتائج
  1. 1
  2. 2

    (a) Radar chart of these algorithms (23 Benchmark functions), (b) The sorting diagram of these algorithms (23 Benchmark functions). حسب Yu Liu (6938)

    منشور في 2025
    "…<p>(a) Radar chart of these algorithms (23 Benchmark functions), (b) The sorting diagram of these algorithms (23 Benchmark functions).…"
  3. 3
  4. 4

    Using synthetic data to test group-searching algorithms in a context where the correct grouping of species is known and uniquely defined. حسب Yuanchen Zhao (12905580)

    منشور في 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). …"
  5. 5
  6. 6

    <b>Opti2Phase</b>: Python scripts for two-stage focal reducer حسب Morgan Najera (21540776)

    منشور في 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.…"
  7. 7
  8. 8
  9. 9

    Experiment 2D and 5D: Progressive Sample Scaling Algorithm To Solve Many-Affine BBOB Functions. حسب Boris Almonacid (4110337)

    منشور في 2024
    "…</p><p dir="ltr"><b>Objectives</b></p><ul><li>Solve Many-Affine BBOB Functions using a Deterministic Algorithm.…"
  10. 10
  11. 11

    If datasets are small and/or noisy, linear-regression-based algorithms for identifying functional groups outperform more complex versions. حسب Yuanchen Zhao (12905580)

    منشور في 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. …"
  12. 12

    Search Algorithms and Loss Functions for Bayesian Clustering حسب David B. Dahl (11761055)

    منشور في 2022
    "…<p>We propose a randomized greedy search algorithm to find a point estimate for a random partition based on a loss function and posterior Monte Carlo samples. …"
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17

    Brief sketch of the quasi-attraction/alignment algorithm. حسب Takayuki Niizato (162226)

    منشور في 2023
    "…The focal agent selects its next direction randomly based on . (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 . …"
  18. 18
  19. 19
  20. 20