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

Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization by Jian-Feng Cai (498405)

Binary contingency table. by Lu Xiao (314030)

Overview of the segmentation algorithm. by Michael C. Robitaille (11949174)

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

RMSE on the test data when fitting (logistic) quadratic models to binary data across increasing measurement error values . by Jakub Stoklosa (3315042)

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

Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization by Sandeep Jagonda Patil (22048337)

“…By integrating Latent Encoder Coupled Generative Adversarial Network (LEGAN) optimized with Binary Emperor Penguin optimizer (BEPO), the scheme enhances routing efficiency and security. …”

The Pseudo-Code of the IRBMO Algorithm. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

IRBMO vs. meta-heuristic algorithms boxplot. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

IRBMO vs. feature selection algorithm boxplot. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

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

QSAR model for predicting neuraminidase inhibitors of influenza A viruses (H1N1) based on adaptive grasshopper optimization algorithm by Z.Y. Algamal (5547620)

“…Obtaining a reliable QSAR model with few descriptors is an essential procedure in chemometrics. The binary grasshopper optimization algorithm (BGOA) is a new meta-heuristic optimization algorithm, which has been used successfully to perform feature selection. …”

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