يعرض 1 - 20 نتائج من 29 نتيجة بحث عن '(((( complement i algorithm ) OR ( element per algorithm ))) OR ( neural coding algorithm ))', وقت الاستعلام: 0.13s تنقيح النتائج
  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

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

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

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

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

    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
  18. 18
  19. 19

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

    منشور في 2017
    "…We transform an essential part of the search process into the task of enumerating maximal independent sets in only a part of only one of the input graphs. 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. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  20. 20

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

    منشور في 2023
    "…Although the scenario analysis is supported by simulation models, they further require the optimization models to yield optimal key parameter values. One noticeable finding is that only 12% of the articles used quantitative models to complement SDM for the decision-making process. …"