Showing 1 - 20 results of 1,300 for search '(( algorithm harding function ) OR ( algorithm b function ))', query time: 0.33s Refine Results
  1. 1

    Cost function calculated by QA with different hyperparameters. by Takuro Matsuta (21608505)

    Published 2025
    Subjects: “…currently available algorithms…”
  2. 2

    Cost function calculated by SA with different hyperparameters. by Takuro Matsuta (21608505)

    Published 2025
    Subjects: “…currently available algorithms…”
  3. 3

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

    Published 2025
    “…<p>(a) Radar chart of these algorithms (23 Benchmark functions), (b) The sorting diagram of these algorithms (23 Benchmark functions).…”
  4. 4

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

    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). …”
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14

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

    Published 2025
    “…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.…”
  15. 15
  16. 16

    Flowchart of proposed algorithm. by Tibebu Legesse (21030014)

    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. …”
  17. 17
  18. 18

    Flowchart of DAPF-RRT algorithm. by Zhenggang Wang (1753657)

    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. …”
  19. 19

    Performance comparison of different algorithms. by Zhenggang Wang (1753657)

    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. …”
  20. 20