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

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

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

    Published 2022
    “…These requirements have motivated the emergence of fog and edge computing to complement the low-privacy and high-latency cloud. The intention behind Fog computing is to place computational servers closer to the user, typically within the city’s vicinity, to reduce latency. …”
  10. 10
  11. 11

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

    Published 1995
    “…The design is based on non-overlapped scanning of 3-bit fields of the multiplier. In this algorithm the partial products of the multiplicand and three bits of the multiplier are pre-calculated using only hardwired shifts. …”
    Get full text
    Get full text
    article
  12. 12
  13. 13

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

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

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

    Published 2020
    “…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …”
    Get full text
    article
  16. 16
  17. 17
  18. 18
  19. 19

    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). …”
  20. 20