Search-based testing (Genetic Algorithm) - Chapter 11 of the book "Software Testing Automation" by Saeed Parsa (13893726)

“…</p> <p><br></p> <p>3. Algorithm</p> <p>Below is the main body of the test data generator program:</p> <p>  </p> <p>the main body of a Python program to generate test data for Python functions.…”

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

Implementation algorithm. by Michael A. Colman (7163735)

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

Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy by Yujin Wu (2901128)

Subjects:

Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy by Yujin Wu (2901128)

Subjects:

(a) Radar chart of 4 algorithms, (b) The sorting diagram of 4 algorithms. by Yu Liu (6938)

Proposed algorithm mean and standard deviation (StDev) versus compared algorithms for the benchmark functions. by El-Sayed M. El-kenawy (14581088)

datasheet1_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.pdf by Santiago Hernández-Orozco (5070209)

“…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…”

datasheet2_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.zip by Santiago Hernández-Orozco (5070209)

“…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…”

datasheet1_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.pdf by Santiago Hernández-Orozco (5070209)

“…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…”

datasheet2_Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces.zip by Santiago Hernández-Orozco (5070209)

“…In doing so we use examples which enable the two approaches to be compared (small, given the computational power required for estimations of algorithmic complexity). We find and report that 1) machine learning can successfully be performed on a non-smooth surface using algorithmic complexity; 2) that solutions can be found using an algorithmic-probability classifier, establishing a bridge between a fundamentally discrete theory of computability and a fundamentally continuous mathematical theory of optimization methods; 3) a formulation of an algorithmically directed search technique in non-smooth manifolds can be defined and conducted; 4) exploitation techniques and numerical methods for algorithmic search to navigate these discrete non-differentiable spaces can be performed; in application of the (a) identification of generative rules from data observations; (b) solutions to image classification problems more resilient against pixel attacks compared to neural networks; (c) identification of equation parameters from a small data-set in the presence of noise in continuous ODE system problem, (d) classification of Boolean NK networks by (1) network topology, (2) underlying Boolean function, and (3) number of incoming edges.…”

Fast and Numerically Stable Particle-Based Online Additive Smoothing: The AdaSmooth Algorithm by Alessandro Mastrototaro (13750061)

“…This yields a new, function-specific additive smoothing algorithm, AdaSmooth, which is computationally fast, numerically stable and easy to implement. …”

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

Subjects: “…evolutionary genetic algorithm…”

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