Search alternatives:
modeling algorithm » scheduling algorithm (Expand Search)
pass algorithm » jaya algorithm (Expand Search)
rd algorithm » _ algorithms (Expand Search)
element » elements (Expand Search)
Showing 1 - 20 results of 178 for search '(((( element rd algorithm ) OR ( element pass algorithm ))) OR ( implement modeling algorithm ))', query time: 0.13s Refine Results
  1. 1
  2. 2

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

    A genetic-based algorithm for fuzzy unit commitment model by Mantawy, A.H.

    Published 2000
    “…The genetic algorithm (GA) approach is then used to solve the proposed fuzzy UCP model. …”
    Get full text
    Get full text
    article
  5. 5

    Nonlinear model predictive control of Hammerstein and Wiener modelsusing genetic algorithms by Al-Duwaish, H.

    Published 2001
    “…In this paper a novel approach for the implementation of nonlinear MPC is proposed using genetic algorithms (GAs). …”
    Get full text
    Get full text
    article
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    Formal synthesis of VLSI layouts from algorithmic specifications by Sait, Sadiq M.

    Published 2020
    “…This formal high level syntesis system uses recursive algorithms to model the behaviour to be synthesized. …”
    Get full text
    article
  11. 11

    A neural networks algorithm for data path synthesis by Harmanani, Haidar M.

    Published 2003
    “…The algorithm is driven by a motion equation that determines the neurons firing conditions based on the modified Hopfield neural network model of computation. …”
    Get full text
    Get full text
    Get full text
    article
  12. 12

    Allocating data to distributed-memory multiprocessors by genetic algorithms by Mansour, Nashat

    Published 2016
    “…The last two are based on models of natural evolution that are suitable for parallel implementation; they have been implemented on a hypercube and a Connection Machine. …”
    Get full text
    Get full text
    Get full text
    article
  13. 13
  14. 14

    A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units by El-Amin, I.

    Published 2020
    “…The algorithm was developed, implemented and tested on an integrated model for the MS problem. …”
    Get full text
    article
  15. 15

    A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units by Duffuaa, S. O.

    Published 2020
    “…The algorithm was developed, implemented and tested on an integrated model for the MS problem. …”
    Get full text
    article
  16. 16
  17. 17

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

    Published 2002
    “…A parallel simulator, based on PVM, was implemented for the proposed algorithm on a Linux Cluster. …”
    Get full text
    Get full text
    article
  18. 18

    Natural optimization algorithms for the cross-dock door assignment problem by Tarhini, Abbas A.

    Published 2016
    “…This paper modifies a classical mathematical model that represents the CDAP and implements an evolutionary metaheuristic SS algorithm and tests it and then compares the results with those of another evolutionary algorithm, i.e., genetic algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  19. 19
  20. 20

    Correlation Clustering via s-Club Cluster Edge Deletion by Makarem, Norma

    Published 2023
    “…In certain situations, the requirement for clusters to be cliques was deemed excessively stringent, leading to the proposal of alternative relaxed clique models for dense subgraphs, such as s-club. In this work, we implement three approaches to tackle the 2-club clustering via edge deletion: a heuristic approach based on the influence of the edge to resolve maximum conflicts, a parameterized algorithm in which by deleting a maximum of k edges, the graph can be transformed into a 2-club cluster based on a branching algorithm, and the approach in Integer Linear Programming to find the optimized solution in an integer formulation. …”
    Get full text
    Get full text
    Get full text
    masterThesis