Optimization results of different algorithms. by Haijian Wang (746739)

“…The results demonstrate that the maximum temperature of the optimized brake wheel during emergency braking was 222.09°C, which is 36.71°C lower than that of 258.8°C before optimization, with a change rate of 14.2%. …”

The algorithm for the same-day surgery protocol. by Magnus Tveit (11442200)

Path comparison before and after smoothing. 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. …”

Comparison before and after path pruning. 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. …”

Running time comparison of different algorithms. by Shuang Guo (294074)

“…Based on the prediction results, a Prediction-based SFV Active Reconfiguration (PSAR) algorithm is proposed to achieve seamless SFC migration and routing update before the user experience quality degrades, ensuring network consistency and high quality service. …”

Optimization flow chart of the AO algorithm. by Haijian Wang (746739)

“…The results demonstrate that the maximum temperature of the optimized brake wheel during emergency braking was 222.09°C, which is 36.71°C lower than that of 258.8°C before optimization, with a change rate of 14.2%. …”

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

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

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

Algorithmic assessment reveals functional implications of GABRD gene variants linked to idiopathic generalized epilepsy by Ayla Arslan (17943365)

“…</p> <p>The study employs a combination of in silico algorithms to analyze 82 variants of unknown clinical significance of GABRD gene sourced from the ClinVar database. …”

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

The losses of the training process before and after the optimization of loss function. by Peihan Wen (6324315)

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

Improved A* algorithm flowchart. by Peiying Li (797714)

“…Specifically, A-star is optimized by evaluation function, sub node selection mode and path smoothness, and fuzzy control is introduced to optimize the sliding window algorithm. …”

In this example the MPC algorithm perfectly tracks the noisy signal , which results in many false spikes. by Nicholas A. Rondoni (21573261)

A Genetic Algorithm Approach for Compact Wave Function Representations in Spin-Adapted Bases by Maru Song (22593561)

“…Crucially, we propose fitness functions based on approximate measures of the wave function compactness, which enable inexpensive genetic algorithm searches. …”