MSE for ILSTM algorithm in binary classification. by Asmaa Ahmed Awad (16726315)

“…The ILSTM was then used to build an efficient intrusion detection system for binary and multi-class classification cases. The proposed algorithm has two phases: phase one involves training a conventional LSTM network to get initial weights, and phase two involves using the hybrid swarm algorithms, CBOA and PSO, to optimize the weights of LSTM to improve the accuracy. …”

An optimal solution for the HFS instance. by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”

Homomorphic binary tree. by Jianhua He (341366)

Comparison based on hard instances from [79]. by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”

Melanoma Skin Cancer Detection Using Deep Learning Methods and Binary GWO Algorithm by Hussein Ali Bardan (21976208)

“…In this work, we propose a novel framework that integrates </p><p dir="ltr">Convolutional Neural Networks (CNNs) for image classification and a binary Grey Wolf Optimization (GWO) </p><p dir="ltr">algorithm for feature selection. …”

Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start by Yifan Wang (380120)

“…The proposed method builds on the COSMO-CAMD framework that utilizes a genetic algorithm for solving optimization-based molecular design problems and COSMO-RS for predicting physical properties of molecules. …”

Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start by Yifan Wang (380120)

“…The proposed method builds on the COSMO-CAMD framework that utilizes a genetic algorithm for solving optimization-based molecular design problems and COSMO-RS for predicting physical properties of molecules. …”

Data_Sheet_1_A Global Optimizer for Nanoclusters.PDF by Maya Khatun (7437011)

“…While generating the trial geometries, a Tabu list is used for storing the information of the already used trial geometries to avoid using the similar trial geometries. …”

The flowchart of the proposed algorithm. by Muhammad Ayyaz Sheikh (18610943)

“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”

Presentation_1_Calibrating Seed-Based Heuristics to Map Short Reads With Sesame.zip by Guillaume J. Filion (9027317)

Data_Sheet_1_Posiform planting: generating QUBO instances for benchmarking.pdf by Georg Hahn (12530469)

“…<p>We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. …”

Datasets and their properties. by Olaide N. Oyelade (14047002)

“…In addition, we designed nested transfer (NT) functions and investigated the influence of the function on the level-1 optimizer. The binary Ebola optimization search algorithm (BEOSA) is applied for the level-1 mutation, while the simulated annealing (SA) and firefly (FFA) algorithms are investigated for the level-2 optimizer. …”

Parameter settings. by Olaide N. Oyelade (14047002)

“…In addition, we designed nested transfer (NT) functions and investigated the influence of the function on the level-1 optimizer. The binary Ebola optimization search algorithm (BEOSA) is applied for the level-1 mutation, while the simulated annealing (SA) and firefly (FFA) algorithms are investigated for the level-2 optimizer. …”

A simple HFS instance. by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”

The scheduling Gantt chart. by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”

Structure and computational framework of IPMMPO. by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”

Data types contained in and . by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”

Data construction of the first and last rows in . by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”

Schematic diagram of PM model. by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”

Schematic diagram of the atomic function . by Xiang Tian (4369285)

“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”