The topology of the NYN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

The result of Wilcoxon signed-rand test. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

The Simulation and optimization process of pipe diameter selection. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

Optional pipe diameter and unit price of NYN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

Optional pipe diameter and unit price of HN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

The topology of HN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

Information of nodes and pipes of HN. by Yi Tao (178829)

Subjects: “…evolutionary genetic algorithm…”

List of selected ranges of movements(ROM), from which features were then counted. by Jindřich Adolf (17334216)

Smoothing curve from GAM model in which the survival of smaller cluster has been modeled as a smooth function of the sample size. by Muhammad Atif (2575789)

Smoothing curve from GAM model in which the survival of smaller cluster has been modeled as a smooth function of the sample size. by Muhammad Atif (2575789)

Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic by 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. …”

Flowchart of DAPF-RRT algorithm. by Zhenggang Wang (1753657)

“…<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. …”

Performance comparison of different algorithms. by Zhenggang Wang (1753657)

“…<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. …”

Video of the experimental trial which is shown in Fig 1. by Pratik Mullick (12851011)

The image of the Aekley function. by Zhengyu Xu (8550660)

The ALO algorithm optimization flowchart. by Wenjing Wang (181404)

“…The total objective function was 1542.54 $/hr, which was an average reduction of 53.55 $/hr compared to the other five algorithms. …”

The IALO algorithm solution flowchart. by Wenjing Wang (181404)

“…The total objective function was 1542.54 $/hr, which was an average reduction of 53.55 $/hr compared to the other five algorithms. …”

Benchmarking functions. by Guilin Yang (583364)

“…To evaluate the performance of the proposed algorithm, 27 well-known test reference functions were selected for experimentation, which showed significant advantages compared to other algorithms. …”

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

“…We provide analytic evidence of the effectiveness of UNCOVER in finding high-quality solutions and show experimentally that UNCOVER finds sets of alterations significantly associated with functional targets in a variety of scenarios. In particular, we show that our algorithms find sets which are better than the ones obtained by the state-of-the-art method, even when sets are evaluated using the statistical score employed by the latter. …”

An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions by Minh Pham (2458399)

“…<p>Many problems in statistics and machine learning can be formulated as an optimization problem of a finite sum of nonsmooth convex functions. We propose an algorithm to minimize this type of objective functions based on the idea of alternating linearization. …”