يعرض 241 - 260 نتائج من 1,330 نتيجة بحث عن '(( algorithm python function ) OR ( ((algorithm python) OR (algorithm b)) function ))*', وقت الاستعلام: 0.22s تنقيح النتائج
  1. 241

    Image and optimization comparison diagram for the Hartmann 4-D function. حسب Kuiyuan Pan (21145338)

    منشور في 2025
    "…<p>(a) Hartmann 4-D three-dimensional function image. (b) Algorithm convergence curve comparison.…"
  2. 242

    Image and optimization comparison diagram for the Schaffer F7 function. حسب Kuiyuan Pan (21145338)

    منشور في 2025
    "…<p>(a) Schaffer F7 three-dimensional function image. (b) Algorithm convergence curve comparison.…"
  3. 243
  4. 244
  5. 245
  6. 246
  7. 247

    Reflection matrix microscopy data and CLASS algorithms حسب Sungsam Kang (18931031)

    منشور في 2025
    "…<h3><b>Reflection matrix microscopy data and CLASS algorithms</b></h3><p dir="ltr">This software package includes essential algorithms for reflection matrix microscope (RMM) and the CLASS algorithm. …"
  8. 248
  9. 249

    (a): These systems were simulated for (0,3] and (0,3] without the prior knowledge about different phases, and the probability density function of points in feature space illustrate... حسب Ali Talebi (7164203)

    منشور في 2025
    "…<p>The points stretch from the dense region corresponding to the spin glass phase (left top) to the dense region corresponding to the ferromagnetic phase (right bottom), representing the mixed phase region. (b): The dense areas are separated by removing the data less than threshold = 0.5 in the probability density function. …"
  10. 250

    Accelerating Fock Build via Hybrid Analytical-Numerical Integration حسب Yong Zhang (5893)

    منشور في 2025
    "…A hybrid analytical-numerical integration scheme is introduced to accelerate the Fock build in self-consistent field (SCF) and time-dependent density functional theory (TDDFT) calculations. To evaluate the Coulomb matrix <b>J</b>[<b>D</b>], the density matrix <b>D</b> is first decomposed into two parts, the superposition of atomic density matrices <b>D</b><sub>⊕</sub><sup><i>A</i></sup> and the rest <b>D</b><sup><i>R</i></sup> = <b>D</b>–<b>D</b><sub>⊕</sub><sup><i>A</i></sup>. …"
  11. 251

    Accelerating Fock Build via Hybrid Analytical-Numerical Integration حسب Yong Zhang (5893)

    منشور في 2025
    "…A hybrid analytical-numerical integration scheme is introduced to accelerate the Fock build in self-consistent field (SCF) and time-dependent density functional theory (TDDFT) calculations. To evaluate the Coulomb matrix <b>J</b>[<b>D</b>], the density matrix <b>D</b> is first decomposed into two parts, the superposition of atomic density matrices <b>D</b><sub>⊕</sub><sup><i>A</i></sup> and the rest <b>D</b><sup><i>R</i></sup> = <b>D</b>–<b>D</b><sub>⊕</sub><sup><i>A</i></sup>. …"
  12. 252
  13. 253
  14. 254
  15. 255
  16. 256

    Final path. حسب Zhenggang Wang (1753657)

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

    Expansion procedure. حسب Zhenggang Wang (1753657)

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

    Artificial potential field method. حسب Zhenggang Wang (1753657)

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

    Modified D-H parameters. حسب Zhenggang Wang (1753657)

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

    Path comparison before and after smoothing. حسب Zhenggang Wang (1753657)

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