Search alternatives:
per algorithm » deer algorithm (Expand Search), rd algorithm (Expand Search), search algorithm (Expand Search)
elements per » elementi per (Expand Search), elements _ (Expand Search)
5a algorithm » rd algorithm (Expand Search), jaya algorithm (Expand Search), _ algorithms (Expand Search)
Showing 1 - 10 results of 10 for search '(((( elements per algorithm ) OR ( complement 5a algorithm ))) OR ( neural scheduling algorithm ))', query time: 0.10s Refine Results
  1. 1
    A Parallel Neural Networks Algorithm for the Clique Partitioning Problem

    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
    Save to List
    Saved in:
  2. 2
    A Neural Networks Algorithm for the Minimum Colouring Problem Using FPGAs†

    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
    Save to List
    Saved in:
  3. 3
    Deep Reinforcement Learning for Resource Constrained HLS Scheduling

    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
    Save to List
    Saved in:
  4. 4
    Prediction of EV Charging Behavior Using Machine Learning

    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
    Save to List
    Saved in:
  5. 5
    A Framework for Predictive Modeling in Sustainable Projects

    A Framework for Predictive Modeling in Sustainable Projects by Labban, Tarek

    Published 2012
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  6. 6
    Correlation Clustering with Overlaps

    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
    Save to List
    Saved in:
  7. 7
    Optimization of Commercially Off the Shelf (COTS) Electric Propulsion System for Low Speed Fuel Cell UAV

    Optimization of Commercially Off the Shelf (COTS) Electric Propulsion System for Low Speed Fuel Cell UAV by Zulkifli, Muhammad

    Published 2013
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  8. 8
    Multidimensional Gains for Stochastic Approximation

    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
    Save to List
    Saved in:
  9. 9
    Machine Learning-Based Approach for EV Charging Behavior

    Machine Learning-Based Approach for EV Charging Behavior by Shahriar, Sakib

    Published 2021
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  10. 10
    On the complexity of multi-parameterized cluster editing

    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
    Save to List
    Saved in:

Search Tools: