بدائل البحث:
harding function » hardening function (توسيع البحث), hearing functions (توسيع البحث), varying functions (توسيع البحث)
python function » protein function (توسيع البحث)
where function » sphere function (توسيع البحث), gene function (توسيع البحث), wave function (توسيع البحث)
harding function » hardening function (توسيع البحث), hearing functions (توسيع البحث), varying functions (توسيع البحث)
python function » protein function (توسيع البحث)
where function » sphere function (توسيع البحث), gene function (توسيع البحث), wave function (توسيع البحث)
-
61
The Simulation and optimization process of pipe diameter selection.
منشور في 2022الموضوعات: "…evolutionary genetic algorithm…"
-
62
Optional pipe diameter and unit price of NYN.
منشور في 2022الموضوعات: "…evolutionary genetic algorithm…"
-
63
Optional pipe diameter and unit price of HN.
منشور في 2022الموضوعات: "…evolutionary genetic algorithm…"
-
64
-
65
-
66
-
67
-
68
-
69
-
70
-
71
Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic
منشور في 2019"…With these practical rules, simple summation algorithms provide sufficiently robust results for the calculation of the density function and its definite integrals. …"
-
72
-
73
Modifying the linear integer programming model objective to include a position bias for activator sites and repressor sites.
منشور في 2024الموضوعات: "…unlike approximation algorithms…"
-
74
Assessing binding site representation across dense arrays.
منشور في 2024الموضوعات: "…unlike approximation algorithms…"
-
75
Comparison of scores obtained by our interpenetration and scoring algorithm (ISA) and ROSETTA for a subset of structures.
منشور في 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). …"
-
76
-
77
-
78
Efficient algorithms to discover alterations with complementary functional association in cancer
منشور في 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. …"
-
79
The parameters of algorithms.
منشور في 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. …"
-
80