يعرض 1 - 20 نتائج من 3,776 نتيجة بحث عن '(( algorithm its function ) OR ( algorithm spc function ))', وقت الاستعلام: 0.30s تنقيح النتائج
  1. 1
  2. 2
  3. 3

    Mean convergence graphs of the evolution in the performance function and its terms through generations in thirty executions of each algorithm. حسب Roberto Castro-Medina (21484990)

    منشور في 2025
    "…<p>Mean convergence graphs of the evolution in the performance function and its terms through generations in thirty executions of each algorithm.…"
  4. 4
  5. 5
  6. 6
  7. 7

    Function graph and algorithm iterative graph. حسب WanRu Zhao (18980374)

    منشور في 2024
    "…The IERWHO algorithm is an improved Wild Horse optimization (WHO) algorithm that combines the concepts of chaotic sequence factor, nonlinear factor, and inertia weights factor. …"
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15

    The ALO algorithm optimization flowchart. حسب Wenjing Wang (181404)

    منشور في 2024
    "…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …"
  16. 16

    The IALO algorithm solution flowchart. حسب Wenjing Wang (181404)

    منشور في 2024
    "…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …"
  17. 17
  18. 18

    Algorithm of the main experiment targeted to measure the perceptual point spread function (pPSF) treating patients visual system including its optics, physiology and psychology as an integrated imaging system, and patient’s perceptions as its output signal. حسب Krzysztof Petelczyc (3954203)

    منشور في 2024
    "…<p>In the algorithm, the following variables were used: “Ic” denotes the intensity of the central diode (Ic = 40 cd); “DIST(i)” is a randomly sorted list of “D” angular stimuli positions distributed equally as a function of distance from 0.24° to 7.67° from the central point (D = 10), while “i” is an index corresponding to the current distance of a probe diode (“d”); “N” denotes the number of trials for each stimuli position (N = 20); “s” denotes the perceptual brightness value transformed to diode luminous intensity by an array “I(s)” corresponds to the table “scale (level)” determined by the algorithm presented in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0306331#pone.0306331.g003" target="_blank">Fig 3</a>; “cnt” is a counter of trials for the current probe diode’s distance, array threshold (d), and slope (d), i.e., it denotes the intensity of the single point of the pPSF and its uncertainty. …"
  19. 19

    Benchmarking functions. حسب Guilin Yang (583364)

    منشور في 2024
    "…Introducing nonlinear convergence factors based on positive cut functions to changing the convergence of algorithms, the early survey capabilities and later development capabilities of the algorithm are balanced. …"
  20. 20