يعرض 1 - 20 نتائج من 26 نتيجة بحث عن '(((( complement _ algorithm ) OR ( elements per algorithm ))) OR ( level colony algorithm ))', وقت الاستعلام: 0.10s تنقيح النتائج
  1. 1
  2. 2

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

    Correlation Clustering with Overlaps حسب Fakhereldine, Amin

    منشور في 2020
    "…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  4. 4
  5. 5

    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. …"
  6. 6
  7. 7
  8. 8

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

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

    On the complexity of multi-parameterized cluster editing حسب Abu-Khzam, Faisal

    منشور في 2017
    "…In other words, Cluster Editing can be solved efficiently when the number of false positives/negatives per single data element is expected to be small compared to the minimum cluster size. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  11. 11

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

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

    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). …"
  15. 15
  16. 16
  17. 17
  18. 18

    Reliability of artificial intelligence in predicting total knee arthroplasty component sizes: a systematic review حسب Loay A. Salman (14150322)

    منشور في 2023
    "…</p><h3>Conclusion</h3><p dir="ltr">This study demonstrated the potential of AI as a valuable complement for planning TKA, exhibiting a satisfactory level of reliability in predicting TKA implant sizes. …"
  19. 19

    An exact and general model order reduction technique for the finite element solution of elastohydrodynamic lubrication problems حسب Habchi, W.

    منشور في 2017
    "…As such, it is exact and it preserves the generality of the solution scheme while reducing the size of its corresponding model and, consequently, the associated computational overhead. The technique is complemented with a splitting algorithm to alleviate the hurdle of solving an arising semidense matrix system. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  20. 20

    Multi-Modal Emotion Aware System Based on Fusion of Speech and Brain Information حسب M. Ghoniem, Rania

    منشور في 2019
    "…Further, EEG is utilized as inner channel complementing speech for more authoritative recognition, by extracting multiple features belonging to time, frequency, and time–frequency. …"
    احصل على النص الكامل
    احصل على النص الكامل