Showing 1 - 20 results of 32 for search '(((( complement _ algorithms ) OR ( complement ii algorithm ))) OR ( neural coding algorithm ))', query time: 0.12s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

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

    Published 2022
    “…For MAESTRO, we build an integrated architecture that includes two new scheduling algorithms for assigning computing workloads to FemtoClouds. …”
  9. 9

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

    Published 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. …”
    Get full text
  10. 10
  11. 11

    Detecting and Predicting Archaeological Sites Using Remote Sensing and Machine Learning—Application to the Saruq Al-Hadid Site, Dubai, UAE by Ben Romdhane, Haifa

    Published 2023
    “…SAR data were complemented with very high-resolution Worldview-3 multispectral images (0.31 m panchromatic, 1.24 m VNIR) to obtain a visual assessment of the study area and its land cover features. …”
    Get full text
  12. 12

    Detecting and Predicting Archaeological Sites Using Remote Sensing and Machine Learning—Application to the Saruq Al-Hadid Site, Dubai, UAE by Ben-Romdhane, Haïfa

    Published 2023
    “…SAR data were complemented with very high-resolution Worldview-3 multispectral images (0.31 m panchromatic, 1.24 m VNIR) to obtain a visual assessment of the study area and its land cover features. …”
    Get full text
    article
  13. 13

    A novel technique for fast multiplication by Sait, Sadiq M.

    Published 1995
    “…These partial products are then added using a tree of carry-save-adders, and finally the sum and carry vectors are added using a carry-look-ahead adder. In case of 2's complement multiplication the tree of carry-save-adders also receives a correction output produced in parallel with the partial products. …”
    Get full text
    Get full text
    article
  14. 14
  15. 15

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

    Published 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. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  16. 16

    A novel technique for fast multiplication by Sait, Sadiq M.

    Published 2020
    “…These partial products are then added using a tree of carry-save-adders, and ® nally the sum and carry vectors are added using a carry-lookahead adder. In the case of 2 s complement multiplication the tree of carry-save-adders also receives a correction output produced in parallel with the partial products. …”
    Get full text
    article
  17. 17

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

    Published 2023
    “…The solution approaches included the genetic algorithm (GA), particle swarm optimization (PSO), and the non-dominated sorting genetic algorithm (NSGA-II). …”
  18. 18

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

    Published 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
  20. 20

    The maximum common subgraph problem by Abu-Khzam, Faisal N.

    Published 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.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject