يعرض 61 - 80 نتائج من 1,273 نتيجة بحث عن '(( algorithm ((harding function) OR (python function)) ) OR ( algorithm where function ))', وقت الاستعلام: 0.46s تنقيح النتائج
  1. 61

    The Simulation and optimization process of pipe diameter selection. حسب Yi Tao (178829)

    منشور في 2022
    الموضوعات: "…evolutionary genetic algorithm…"
  2. 62

    Optional pipe diameter and unit price of NYN. حسب Yi Tao (178829)

    منشور في 2022
    الموضوعات: "…evolutionary genetic algorithm…"
  3. 63

    Optional pipe diameter and unit price of HN. حسب Yi Tao (178829)

    منشور في 2022
    الموضوعات: "…evolutionary genetic algorithm…"
  4. 64

    The topology of HN. حسب Yi Tao (178829)

    منشور في 2022
    الموضوعات: "…evolutionary genetic algorithm…"
  5. 65

    Information of nodes and pipes of HN. حسب Yi Tao (178829)

    منشور في 2022
    الموضوعات: "…evolutionary genetic algorithm…"
  6. 66
  7. 67
  8. 68
  9. 69
  10. 70
  11. 71

    Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic حسب NELSON L. DIAS (8078003)

    منشور في 2019
    "…With these practical rules, simple summation algorithms provide sufficiently robust results for the calculation of the density function and its definite integrals. …"
  12. 72

    S5 Fig - حسب Virgile Andreani (17087764)

    منشور في 2024
    الموضوعات: "…unlike approximation algorithms…"
  13. 73
  14. 74

    Assessing binding site representation across dense arrays. حسب Virgile Andreani (17087764)

    منشور في 2024
    الموضوعات: "…unlike approximation algorithms…"
  15. 75

    Comparison of scores obtained by our interpenetration and scoring algorithm (ISA) and ROSETTA for a subset of structures. حسب Kevin Sawade (16726527)

    منشور في 2023
    "…Rosetta scores range from −250 to ≈ 18 000 Rosetta Energy Units (REU). ROSETTA’s scoring functions with default weights support our claim that many structures exhibit lower scores, as the most structures can be found for lower scores where a high bin count can be observed (A). …"
  16. 76
  17. 77
  18. 78

    Efficient algorithms to discover alterations with complementary functional association in cancer حسب Rebecca Sarto Basso (6728921)

    منشور في 2019
    "…We propose a combinatorial formulation for the problem, and prove that the associated computational problem is computationally hard. We design two algorithms to solve the problem and implement them in our tool UNCOVER. …"
  19. 79

    The parameters of algorithms. حسب Le Huu Binh (18340233)

    منشور في 2025
    "…However, solving the RNP problem in WMN is difficult because it is NP-hard. As a result, this problem can only be solved using approximate optimization algorithms such as heuristics and meta-heuristics. …"
  20. 80