Flowchart of DAPF-RRT algorithm. حسب 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. حسب 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. …"

The image of the Aekley function. حسب Zhengyu Xu (8550660)

The ALO algorithm optimization flowchart. حسب 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. حسب 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. حسب 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 حسب 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 حسب 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. …"

Function convergence curve. حسب 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. …"

Continuous Probability Distributions generated by the PIPE Algorithm حسب LUIS G.B. PINHO (14073372)

"…The PIPE algorithm can generate several candidate functions to fit the empirical distribution of data. …"

23 benchmark functions. حسب Yu Liu (6938)

"…<div><p>The competition of tribes and cooperation of members algorithm (CTCM) is a novel swarm intelligence algorithm, which increases the diversity of the population to a certain extent through tribal competition and member cooperation mechanisms. …"

Pipeline of the interactor algorithm. حسب Jose Cleydson F. Silva (8685594)

Predictions from a Universal Value Function Approximator (UVFA) algorithm. حسب Sam Hall-McMaster (10343795)

The SSIM for the different algorithms. حسب Bingbing Li (461702)

"…The mean square error decreased by 0.10dB. When using the algorithm for denoising, the research method had a minimum denoising time of only 13ms, which saved 9ms and 3ms compared to the hard threshold algorithm (Hard TA) and soft threshold algorithm (Soft TA), respectively. …"

Algorithm operation steps. حسب Junyan Wang (4738518)

"…To address these issues, this paper proposes an improved object detection algorithm named SCI-YOLO11, which optimizes the YOLO11 framework from three aspects: feature extraction, attention mechanism, and loss function. …"

Comparison of algorithm search curves. حسب Bowen Li (200859)

"…At the same time, the characteristics of Gaussian function are introduced to ensure the activity of hidden layer neurons. …"

ANOVA tests for Benchmark functions. حسب Yu Liu (6938)

"…<div><p>The competition of tribes and cooperation of members algorithm (CTCM) is a novel swarm intelligence algorithm, which increases the diversity of the population to a certain extent through tribal competition and member cooperation mechanisms. …"

The Wilcoxon results for Benchmark functions. حسب Yu Liu (6938)

"…<div><p>The competition of tribes and cooperation of members algorithm (CTCM) is a novel swarm intelligence algorithm, which increases the diversity of the population to a certain extent through tribal competition and member cooperation mechanisms. …"

Convergence graphs of Benchmark functions. حسب Yu Liu (6938)

"…<div><p>The competition of tribes and cooperation of members algorithm (CTCM) is a novel swarm intelligence algorithm, which increases the diversity of the population to a certain extent through tribal competition and member cooperation mechanisms. …"

The pseudocode for the NAFPSO algorithm. حسب Huichao Guo (14515171)

"…In addition, with the increase of pipeline complexity, NACFPSO can still maintain its advantages in convergence speed and scheduling time, especially in scheduling time, which further verifies the optimization effect of the algorithm in emergency management.…"