Python-based Monte Carlo Simulation Tool by Yangfan Jiang (9372782)

Results of searching performance of the improved NAG algorithm on Rosenbrock function, Ackley function, and Rastrigin function. by Rui Zhang (13940)

Results of searching performance of different algorithm models on the Rosenbrock function, Ackley function, and Rastrigin function. by Rui Zhang (13940)

Results of searching performance of the improved NAG algorithm on Sphere function and Griewank function. by Rui Zhang (13940)

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

“…<div><p>Abstract We investigate the use of the Probabilistic Incremental Programming Evolution (PIPE) algorithm as a tool to construct continuous cumulative distribution functions to model given data sets. …”

a) FO Function, b) FI function. by Huang Jiexian (17060975)

“…The SRL32 primitive (Reconfigurable Look up Tables—RLUTs) and DPR (Dynamic Partial Reconfiguration) are employed to reconfigure single round MISTY1 / KASUMI algorithms on the run-time. The RLUT based architecture attains dynamic logic functionality without extra hardware resources by internally modifying the LUT contents. …”

<b></b>Magnetic Kernels: A Theoretical and Algorithmic Framework for the P vs NP Problem by DURGHAM QARALLEH (21904172)

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

Algorithm results based on FE simulated likelihood functions. by Nicolas Herzig (9230425)

“…<p>(A) Nodule depth estimation by the algorithm with the likelihood functions obtained by FEM simulation. …”

Distribution of objective function values solved by three algorithms. by Meilin Zhu (688698)

Schematic diagram of the TEAPS algorithm. by Yoshiaki Kariya (13767985)

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

A Python Package for the Localization of Protein Modifications in Mass Spectrometry Data by Anthony S. Barente (14035175)

Subjects:

(a) Flow chart for PSO algorithm (b) position and velocity update of particles (c) convergence of PSO. by Waqas Anjum (8415186)

Approximate energy consumed per particles in <i>nano Joules</i> (<i>nJ</i>) for various computation platforms and algorithms (A: first algorithm, B: second algorithm, C: third algo... by Abedalmuhdi Almomany (18547669)

Original data for the study "<b>Improving basin-wide flood estimation from a global hydrological model through spatiotemporal-pattern-</b><b>based </b><b>machine learning</b>" by Jiaqing Wang (18814630)

Convergence curve of others functions compared with the PSO family algorithms. by Yong Gao (29929)

Convergence curve of unimodal functions compared with the PSO family algorithms. by Yong Gao (29929)

Convergence curve of unimodal functions compared with the meta-heuristic algorithms. by Yong Gao (29929)