يعرض 1 - 10 نتائج من 10 نتيجة بحث عن '(((( elements per algorithm ) OR ( taste function algorithm ))) OR ( neural scheduling algorithm ))', وقت الاستعلام: 0.11s تنقيح النتائج
  1. 1

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

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

    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs† حسب Harmanani, Haidar

    منشور في 2010
    "…The proposed algorithm has a time complexity of O(1) for a neural network with n vertices and k colours. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  3. 3

    Deep Reinforcement Learning for Resource Constrained HLS Scheduling حسب Makhoul, Rim

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

    Prediction of EV Charging Behavior Using Machine Learning حسب Shahriar, Sakib

    منشور في 2021
    "…Using data-driven tools and machine learning algorithms to learn the EV charging behavior can improve scheduling algorithms. …"
    احصل على النص الكامل
    article
  5. 5
  6. 6

    Correlation Clustering with Overlaps حسب Fakhereldine, Amin

    منشور في 2020
    "…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  7. 7
  8. 8
  9. 9
  10. 10

    On the complexity of multi-parameterized cluster editing حسب Abu-Khzam, Faisal

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