Showing 1 - 20 results of 31 for search '(((( complement based algorithm ) OR ( element graph algorithms ))) OR ( neural coding algorithm ))', query time: 0.12s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    GENETIC SCHEDULING OF TASK GRAPHS by Benten, M. S.

    Published 2020
    “…A genetic algorithm for scheduling computational task graphs is presented. …”
    Get full text
    article
  6. 6
  7. 7
  8. 8
  9. 9

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

    Published 2002
    “…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
    Get full text
    Get full text
    article
  10. 10

    Properties of Unique Degree Sequences of 3-Uniform Hypergraphs by Tarsissi, Lama

    Published 2021
    “…A well known result of Erdös and Gallai (1960) shows that the same problem related to graphs can be solved in polynomial time. So, it becomes relevant to detect classes of uniform hypergraphs that are reconstructible in polynomial time. …”
    Get full text
  11. 11

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

    Correlation Clustering with Overlaps by Fakhereldine, Amin

    Published 2020
    “…The Cluster Editing problem asks for transforming a given graph into a disjoint union of cliques by applying a minimal number of edge-editing operations. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  13. 13
  14. 14
  15. 15
  16. 16

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

    Published 2022
    “…<p dir="ltr">Many novel IoT-based applications demand low latency, large compute resources, and high privacy. …”
  17. 17

    On the complexity of multi-parameterized cluster editing by Abu-Khzam, Faisal

    Published 2017
    “…The Cluster Editing problem seeks a transformation of a given undirected graph into a disjoint union of cliques via a minimum number of edge additions or deletions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  18. 18

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

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

    Published 1995
    “…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
  20. 20