Showing 1 - 20 results of 118 for search '(( binary case based optimization algorithm ) OR ( library based improve optimization algorithm ))', query time: 0.68s Refine Results
  1. 1
  2. 2
  3. 3

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

    Published 2023
    “…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. …”
  4. 4
  5. 5
  6. 6

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

    Published 2025
    “…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. …”
  7. 7

    A Practical Algorithm to Solve the Near-Congruence Problem for Rigid Molecules and Clusters by José Manuel Vásquez-Pérez (12843737)

    Published 2023
    “…We present an improved algorithm to solve the near-congruence problem for rigid molecules and clusters based on the iterative application of assignment and alignment steps with biased Euclidean costs. …”
  8. 8
  9. 9
  10. 10

    RosettaAMRLD: A Reaction-Driven Approach for Structure-Based Drug Design from Combinatorial Libraries with Monte Carlo Metropolis Algorithms by Yidan Tang (6623693)

    Published 2025
    “…The Rosetta automated Monte Carlo reaction-based ligand design (RosettaAMRLD) integrates a Monte Carlo Metropolis (MCM) algorithm and reaction-driven molecule proposal to enhance structure-based <i>de novo</i> drug discovery. …”
  11. 11
  12. 12

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

    Published 2025
    “…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. …”
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20