Showing 1 - 20 results of 25 for search '(( element graph algorithms ) OR ((( element making algorithm ) OR ( neural coding algorithm ))))', query time: 0.15s Refine Results
  1. 1
  2. 2
  3. 3

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

    Published 2021
    “…The existence of this hypergraph makes us conjecture an extended generating algorithm for the sequences of Deza et al. to include a much wider class of unique 3-uniform hypergraphs. …”
    Get full text
  4. 4
  5. 5
  6. 6

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

    A Data-Driven Decision-Making Framework for Fleet Management in the Government Sector of Dubai by ALGHANEM, HANI SUBHI MOHD

    Published 2024
    “…The proposed framework comprises key elements: Important Decisions derived from interviews with transportation leaders, Knowledge Management enhanced by AI algorithms, Data Mining/Analysis utilizing historical data, the Fleet Management System employing Oracle ERP, and a Data-Driven Decision Support Framework that leans towards the extended framework approach. …”
    Get full text
  11. 11

    Adaptive bias simulated evolution algorithm for placement by Youssef, H.

    Published 2001
    “…In this work, we propose an adaptive bias scheme which adjusts automatically to the quality of solution and makes the algorithm independent of the problem class or instance, as well as any user defined value. …”
    Get full text
    Get full text
    article
  12. 12

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

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