يعرض 1 - 20 نتائج من 49 نتيجة بحث عن '(((( complement i algorithm ) OR ( elements research algorithm ))) OR ( neural coding algorithm ))', وقت الاستعلام: 0.14s تنقيح النتائج
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9

    Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements حسب Stefano Nardean (14151900)

    منشور في 2023
    "…Therefore, we designed a dedicated two-stage strategy, inspired by the CPR algorithm, where a block preconditioner is used for the pressure part with the aim at exploiting the inner $$2\times 2$$ 2 × 2 structure. …"
  10. 10

    The Frontiers of Deep Reinforcement Learning for Resource Management in Future Wireless HetNets: Techniques, Challenges, and Research Directions حسب Abdulmalik Alwarafy (17984104)

    منشور في 2022
    "…To this end, we carefully identify the types of DRL algorithms utilized in each related work, the elements of these algorithms, and the main findings of each related work. …"
  11. 11

    Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing حسب Abualigah, Laith

    منشور في 2024
    "…The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. …"
    احصل على النص الكامل
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    A novel technique for fast multiplication حسب Sait, Sadiq M.

    منشور في 2020
    "…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …"
    احصل على النص الكامل
    article
  17. 17
  18. 18

    A novel technique for fast multiplication حسب Sait, Sadiq M.

    منشور في 1995
    "…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  19. 19

    A new approach and faster exact methods for the maximum common subgraph problem حسب Abu-Khzam, Faisal N.

    منشور في 2017
    "…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  20. 20