يعرض 1 - 20 نتائج من 31 نتيجة بحث عن '(((( complement based algorithm ) OR ( element graph algorithms ))) OR ( neural coding algorithm ))', وقت الاستعلام: 0.13s تنقيح النتائج
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    GENETIC SCHEDULING OF TASK GRAPHS حسب Benten, M. S.

    منشور في 2020
    "…A genetic algorithm for scheduling computational task graphs is presented. …"
    احصل على النص الكامل
    article
  6. 6
  7. 7
  8. 8
  9. 9

    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem حسب Harmanani, Haidar M.

    منشور في 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. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  10. 10

    Properties of Unique Degree Sequences of 3-Uniform Hypergraphs حسب Tarsissi, Lama

    منشور في 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. …"
    احصل على النص الكامل
  11. 11

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

    Correlation Clustering with Overlaps حسب Fakhereldine, Amin

    منشور في 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. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  13. 13
  14. 14
  15. 15
  16. 16

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

    منشور في 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 حسب Abu-Khzam, Faisal

    منشور في 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. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  18. 18

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

    A novel technique for fast multiplication حسب Sait, Sadiq M.

    منشور في 1995
    "…In this algorithm the partial products of the multiplicand and three bits of the multiplier are pre-calculated using only hardwired shifts. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  20. 20