Showing 1 - 17 results of 17 for search '(((( implement pass algorithm ) OR ( elements rf algorithm ))) OR ( neural scheduling algorithm ))', query time: 0.10s 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
  4. 4

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

    A New Parallel Genetic Algorithm Model by Al-Somani, Turki F.

    Published 2020
    “…This paper presents an implementation of three Genetic Algorithm models for solving a reliability optimization problem for a redundancy system with several failure modes, a modification on a parallel a genetic algorithm model and a new parallel genetic algorithm model. …”
    Get full text
    article
  6. 6

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

    New primitives to AOP weaving capabilities for security hardening concerns by Mourad, Azzam

    Published 2007
    “…These primitives are called exportParameter and importParameter and are used to pass parameters between two point cuts. They allow to analyze a program’s call graph in order to determine how to change function signatures for the passing of parameters associated with a given security hardening. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  10. 10
  11. 11
  12. 12
  13. 13

    New aspect-oriented constructs for security hardening concerns by Mourad, Azzam

    Published 2009
    “…Moreover, we show the viability and correctness of the proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the result of explanatory case studies.…”
    Get full text
    Get full text
    Get full text
    article
  14. 14

    Nouveaux points de coupure et primitives pour les préoccupations de renforcement de sécurité by Mourad, Azzam

    Published 2009
    “…Moreover, we show the viability and correctness of our proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the results of explanatory case studies.…”
    Get full text
    Get full text
    Get full text
    article
  15. 15

    An Artificial Intelligence Approach for Predictive Maintenance in Electronic Toll Collection System by Alkhatib, Osama

    Published 2019
    “…Meaning no “perfect” machine learning algorithm that will produce good results at particular problem, in fact for each type of problem a specific algorithm is suited and might achieves good outcome, while another algorithm fails heavily. …”
    Get full text
  16. 16

    A survey and comparison of wormhole routing techniques in a meshnetworks by Al-Tawil, K.M.

    Published 1997
    “…Although an extremely wide number of routing algorithms have been proposed and implemented in hardware and software, it is difficult for the designer of a multicomputer to choose the best routing algorithm given a particular architectural configuration. …”
    Get full text
    Get full text
    article
  17. 17