Showing 1 - 20 results of 52 for search '(( binary a structure optimization algorithm ) OR ( lines based wolf optimization algorithm ))', query time: 0.51s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9

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

    Published 2020
    “…The binary grasshopper optimization algorithm (BGOA) is a new meta-heuristic optimization algorithm, which has been used successfully to perform feature selection. …”
  10. 10
  11. 11

    Predicting Thermal Decomposition Temperature of Binary Imidazolium Ionic Liquid Mixtures from Molecular Structures by Hongpeng He (348094)

    Published 2021
    “…Both in silico design and data analysis descriptors and norm index were employed to encode the structural characteristics of binary IL mixtures. The subset of optimal descriptors was screened by combining the genetic algorithm with the multiple linear regression method. …”
  12. 12

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

    Published 2025
    “…The performance of the proposed LEGAN-BEPO-BCMANET technique attains 29.786%, 19.25%, 22.93%, 27.21%, 31.02%, 26.91%, and 25.61% greater throughput, compared to existing methods like Blockchain-based BATMAN protocol utilizing MANET with an ensemble algorithm (BATMAN-MANET), Block chain-based trusted distributed routing scheme with optimized dropout ensemble extreme learning neural network in MANET (DEELNN-MANET), A secured trusted routing utilizing structure of a new directed acyclic graph-blockchain in MANET internet of things environment (DAG-MANET), An Optimized Link State Routing Protocol with Blockchain Framework for Efficient Video-Packet Transmission and Security over MANET (OLSRP-MANET), Auto-metric Graph Neural Network based Blockchain Technology for Protected Dynamic Optimum Routing in MANET (AGNN-MANET) and Data security-based routing in MANETs under key management process (DSR-MANET) respectively.…”
  13. 13
  14. 14

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

    Published 2023
    “…While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting, for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. …”
  15. 15
  16. 16

    Performance on GradEva. by Jamilu Yahaya (18563445)

    Published 2024
    “…The sequences generated by our algorithm identify points that satisfy the first-order necessary condition for Pareto optimality. …”
  17. 17

    The considered test problems. by Jamilu Yahaya (18563445)

    Published 2024
    “…The sequences generated by our algorithm identify points that satisfy the first-order necessary condition for Pareto optimality. …”
  18. 18

    Performance on FunEva. by Jamilu Yahaya (18563445)

    Published 2024
    “…The sequences generated by our algorithm identify points that satisfy the first-order necessary condition for Pareto optimality. …”
  19. 19

    Performance on Iter. by Jamilu Yahaya (18563445)

    Published 2024
    “…The sequences generated by our algorithm identify points that satisfy the first-order necessary condition for Pareto optimality. …”
  20. 20

    Continuation of Table 2. by Jamilu Yahaya (18563445)

    Published 2024
    “…The sequences generated by our algorithm identify points that satisfy the first-order necessary condition for Pareto optimality. …”