Showing 1 - 20 results of 174 for search '(( complement based algorithm ) OR ((( second ii algorithm ) OR ( neural scheduling algorithm ))))', query time: 0.15s Refine Results
  1. 1
  2. 2

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

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

    Hardening the ElGamal Cryptosystem in the Setting of the Second Group of Units by ElKassar, AbdulNasser

    Published 2014
    “…In this paper, we consider yet another extension to the Elgamal cryptosystem employing the second group of units of Zn and the second group of units of Z2[x]/<h(x)>, where h(x) is an irreducible polynomial. …”
    Get full text
    Get full text
    Get full text
    article
  8. 8

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

    Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem by Denis Alicic (23073484)

    Published 2025
    “…We propose a twofold contribution: first, an adaptive greedy algorithm that generates high-quality initial solutions, achieving markedly better results than traditional constructive heuristics at comparable computational costs; and second, the adaptation of the Matheuristic Fixed Set Search (MFSS) to the TSCFLP. …”
  10. 10
  11. 11

    A genetic algorithm approach for regrouping service sites by Mansour, Nashat

    Published 2004
    “…In the first phase, the graph is decomposed into the required number of subgraphs (regions) using a tuned hybrid genetic algorithm. The second phase finds a suitable center within each region by using a heuristic algorithm. …”
    Get full text
    Get full text
    Get full text
    article
  12. 12
  13. 13

    Exploratory risk prediction of type II diabetes with isolation forests and novel biomarkers by Yousef, Hibba

    Published 2024
    “…Type II diabetes mellitus (T2DM) is a rising global health burden due to its rapidly increasing prevalence worldwide, and can result in serious complications. …”
    Get full text
  14. 14

    Economic load dispatch using memetic sine cosine algorithm by Abu Zitar, Raed

    Published 2022
    “…The proposed hybrid algorithm is abbreviated as SCA-βHC which is evaluated using two sets of real-world generation cases: (i) 3-units, two versions of 13-units, and 40-units, with neglected Ramp Rate Limits and Prohibited Operating Zones constraints. …”
    Get full text
  15. 15
  16. 16
  17. 17
  18. 18

    Power Control Algorithms for Media Transmission in Remote Healthcare Systems by Ali Hassan Sodhro (18629392)

    Published 2018
    “…Thus, this paper first proposes a transmission power control (TPC)-based energy-efficient algorithm (EEA) for when a subject is in different postures, i.e., standing, walking, and running, in wireless body sensor networks. …”
  19. 19
  20. 20

    Wild Blueberry Harvesting Losses Predicted with Selective Machine Learning Algorithms by Humna Khan (17541972)

    Published 2022
    “…When comparing the actual and anticipated ground loss, the SVR performed best (R<sup>2</sup> = 0.79–0.93) as compared to the other two algorithms i.e., LR (R<sup>2</sup> = 0.73 to 0.92), and RF (R<sup>2</sup> = 0.53 to 0.89) for the three fields. …”