Showing 1 - 20 results of 26 for search '(( binary data driven optimization algorithm ) OR ( binary data robust optimization algorithm ))*', query time: 0.51s Refine Results
  1. 1
  2. 2
  3. 3

    Event-driven data flow processing. by Yixian Wen (12201388)

    Published 2025
    “…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
  4. 4

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

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

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

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

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

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

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

    Flow diagram of the proposed model. by Uğur Ejder (22683228)

    Published 2025
    “…<div><p>Machine learning models are increasingly applied to assisted reproductive technologies (ART), yet most studies rely on conventional algorithms with limited optimization. This proof-of-concept study investigates whether a hybrid Logistic Regression–Artificial Bee Colony (LR–ABC) framework can enhance predictive performance in in vitro fertilization (IVF) outcomes while producing interpretable, hypothesis-driven associations with nutritional and pharmaceutical supplement use. …”
  9. 9

    IRBMO vs. variant comparison adaptation data. by Chenyi Zhu (9383370)

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

    Pseudo Code of RBMO. by Chenyi Zhu (9383370)

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

    P-value on CEC-2017(Dim = 30). by Chenyi Zhu (9383370)

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

    Memory storage behavior. by Chenyi Zhu (9383370)

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

    Elite search behavior. by Chenyi Zhu (9383370)

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

    Description of the datasets. by Chenyi Zhu (9383370)

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

    S and V shaped transfer functions. by Chenyi Zhu (9383370)

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

    S- and V-Type transfer function diagrams. by Chenyi Zhu (9383370)

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

    Collaborative hunting behavior. by Chenyi Zhu (9383370)

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

    Friedman average rank sum test results. by Chenyi Zhu (9383370)

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

    Confusion matrix. by Yixian Wen (12201388)

    Published 2025
    “…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
  20. 20

    Parameter settings. by Yixian Wen (12201388)

    Published 2025
    “…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”