Reward function related parameters. حسب Honglei Pang (22693724)

الموضوعات:

Example of the CNF function for off-axis DHM holograms recorded in a non-telecentric configuration. حسب Raul Castañeda (13932971)

Summary of greedy algorithms presented in this section. Details of approximation factors for FastGreedy and UnitGreedy may be found in [26] and [25], respectively. حسب Jeffrey Keithley (14626551)

الموضوعات:

3D modeling qualities of the AS single-template models built by including DOPE in the objective function of MODELLER. حسب Giacomo Janson (8138517)

3D modeling qualities of the AM multiple-template models built by including DOPE in the objective function of MODELLER. حسب Giacomo Janson (8138517)

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

الموضوعات: "…evolutionary genetic algorithm…"

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

الموضوعات: "…evolutionary genetic algorithm…"

The result of Wilcoxon signed-rand test. حسب Yi Tao (178829)

الموضوعات: "…evolutionary genetic algorithm…"

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

الموضوعات: "…evolutionary genetic algorithm…"

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

الموضوعات: "…evolutionary genetic algorithm…"

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

الموضوعات: "…evolutionary genetic algorithm…"

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

الموضوعات: "…evolutionary genetic algorithm…"

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

الموضوعات: "…evolutionary genetic algorithm…"

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

"…With these practical rules, simple summation algorithms provide sufficiently robust results for the calculation of the density function and its definite integrals. …"

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

"…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. …"

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

"…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. …"

CEL0, and to a lesser extent, <i>ℓ</i>_1/2, and hard thresholding produce sparser codes than ISTA. حسب Ilias Rentzeperis (10215602)

Percentage totBurden and percentage maxBurden reduced by UnitGreedy, SingletonGreedy, FastGreedy and baselines for = 0.535 in Iowa for FRED (first column) and SafeGraph (second col... حسب Jeffrey Keithley (14626551)

الموضوعات:

Metapopulation model notation. حسب Jeffrey Keithley (14626551)

الموضوعات:

Estimates of for each problem instance. حسب Jeffrey Keithley (14626551)

الموضوعات: