Showing 1 - 10 results of 10 for search '(((( element per algorithm ) OR ( complement rd algorithm ))) OR ( neural scheduling algorithm ))', query time: 0.09s Refine Results
  1. 1

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

    Published 2002
    “…The clique partitioning problem has important applications in many areas including VLSI design automation, scheduling, and resources allocation. 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
  2. 2

    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† by Harmanani, Haidar

    Published 2010
    “…The proposed algorithm has a time complexity of O(1) for a neural network with n vertices and k colours. …”
    Get full text
    Get full text
    Get full text
    article
  3. 3

    Deep Reinforcement Learning for Resource Constrained HLS Scheduling by Makhoul, Rim

    Published 2022
    “…The two main steps in HLS are: operations scheduling and data-path allocation. In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  4. 4

    Prediction of EV Charging Behavior Using Machine Learning by Shahriar, Sakib

    Published 2021
    “…Using data-driven tools and machine learning algorithms to learn the EV charging behavior can improve scheduling algorithms. …”
    Get full text
    article
  5. 5
  6. 6

    Correlation Clustering with Overlaps by Fakhereldine, Amin

    Published 2020
    “…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  7. 7
  8. 8

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

    Published 2017
    “…In other words, Cluster Editing can be solved efficiently when the number of false positives/negatives per single data element is expected to be small compared to the minimum cluster size. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  9. 9
  10. 10

    Multidimensional Gains for Stochastic Approximation by Saab, Samer S.

    Published 2019
    “…The proposed algorithms here aim for per-iteration minimization of the mean square estimate error. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article