يعرض 1 - 20 نتائج من 32 نتيجة بحث عن '(( complement _ algorithm ) OR ((( movement bouts algorithms ) OR ( neural coding algorithm ))))', وقت الاستعلام: 0.11s تنقيح النتائج
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    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. …"
    احصل على النص الكامل
  9. 9
  10. 10

    MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments حسب Hend Gedawy (23275984)

    منشور في 2022
    "…For MAESTRO, we build an integrated architecture that includes two new scheduling algorithms for assigning computing workloads to FemtoClouds. …"
  11. 11
  12. 12

    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
  13. 13
  14. 14

    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
  15. 15

    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
  16. 16
  17. 17

    The maximum common subgraph problem حسب Abu-Khzam, Faisal N.

    منشور في 2017
    "…This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  18. 18

    A Literature Review on System Dynamics Modeling for Sustainable Management of Water Supply and Demand حسب Khawar Naeem (17984062)

    منشور في 2023
    "…The solution approaches included the genetic algorithm (GA), particle swarm optimization (PSO), and the non-dominated sorting genetic algorithm (NSGA-II). …"
  19. 19

    Oversampling techniques for imbalanced data in regression حسب Samir Brahim Belhaouari (9427347)

    منشور في 2024
    "…For tabular data, we also present the Auto-Inflater neural network, utilizing an exponential loss function for Autoencoders. …"
  20. 20