يعرض 1 - 20 نتائج من 25 نتيجة بحث عن '(( binary each structure optimization algorithm ) OR ( binary task policy optimization algorithm ))', وقت الاستعلام: 0.99s تنقيح النتائج
  1. 1

    Proposed Algorithm. حسب Hend Bayoumi (22693738)

    منشور في 2025
    الموضوعات:
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7

    An Example of a WPT-MEC Network. حسب Hend Bayoumi (22693738)

    منشور في 2025
    الموضوعات:
  8. 8

    Related Work Summary. حسب Hend Bayoumi (22693738)

    منشور في 2025
    الموضوعات:
  9. 9

    Simulation parameters. حسب Hend Bayoumi (22693738)

    منشور في 2025
    الموضوعات:
  10. 10

    Training losses for N = 10. حسب Hend Bayoumi (22693738)

    منشور في 2025
    الموضوعات:
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15

    Summary of Notations Used in this paper. حسب Hend Bayoumi (22693738)

    منشور في 2025
    الموضوعات:
  16. 16

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

    منشور في 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.…"
  17. 17

    Analysis and design of algorithms for the manufacturing process of integrated circuits حسب Sonia Fleytas (16856403)

    منشور في 2023
    "…This process can be modeled as a combinatorial optimization problem where the objective is to reduce the total distance the robotic arm must travel to pick up each chip and place it in its corresponding position within the support structure. …"
  18. 18

    Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes حسب Yu Y. (3096192)

    منشور في 2022
    "…We consider two approximate approaches to maximizing the marginal likelihood: (i) a Monte Carlo EM algorithm (MCEM) and (ii) a Laplace approximation (LA) to each integral, followed by derivative-free optimization of the approximation. …"
  19. 19
  20. 20