Showing 721 - 740 results of 1,056 for search '(( element data algorithm ) OR ((( data using algorithm ) OR ( problem using algorithm ))))*', query time: 0.10s Refine Results
  1. 721

    An evolutionary approach to load balancing parallel computations by Mansour, Nashat

    Published 1991
    “…It is based on a genetic algorithm that combines a number of design choices in order to ameliorate the problem of premature convergence. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  2. 722
  3. 723

    "A Tabu Search Approach for the Design of Variable Structure Load Frequency Controller Incorporating Model Nonlinearities" by Al-Hamouz, Z.

    Published 2007
    “…This paper presents a new method of designing Variable Structure Controllers (VSC) applied to the Load Frequency Control (LFC) problem. The proposed method formulates the design of VSC as an optimization problem and utilizes Tabu Search Algorithm (TS) to find the optimal settings of the controller. …”
    Get full text
    article
  4. 724

    Power system output feedback stabilizer design via geneticalgorithms by Abdel-Magid, Y.L.

    Published 1997
    “…The paper demonstrates the use of genetic algorithms to design output feedback power system stabilizers. …”
    Get full text
    Get full text
    article
  5. 725

    FoGMatch by Arisdakessian, Sarhad

    Published 2019
    “…This results in an unfair situation wherein the needs of one of the parties are ignored in the scheduling process. To address this problem, we propose in this paper a multi-criteria intelligent IoT scheduling approach in fog computing environments using matching game theory. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  6. 726
  7. 727

    Robust tuning of power system stabilizers in multimachine powersystems by Abdel-Magid, Y.L.

    Published 2000
    “…A classical lead-lag power system stabilizer is used to demonstrate the technique. The problem of selecting the stabilizer parameters is converted to a simple optimization problem with an eigenvalue-based objective function, which is solved by a tabu search algorithm. …”
    Get full text
    Get full text
    article
  8. 728

    Maximum common induced subgraph parameterized by vertex cover by Abu-Khzam, Faisal N.

    Published 2014
    “…A classical graph parameter that has been used recently in many parameterization problems is Vertex Cover. …”
    Get full text
    Get full text
    Get full text
    article
  9. 729
  10. 730

    Development of Machine Learning Models for Studying the Premixed Turbulent Combustion of Gas-To-Liquids (GTL) Fuel Blends by Abdellatif M. Sadeq (16931841)

    Published 2024
    “…In addition, the possible minimum and maximum values of responses at the corresponding operating parameters are found using a genetic algorithm (GA) approach. Model 1 could capture the computational fluid dynamics (CFD) outputs with high precision at different flame radiuses and time instants with a maximum absolute error percentage of 5.46%. …”
  11. 731
  12. 732

    Fast force-directed/simulated evolution hybrid for multiobjective VLSI cell placement by Sait, Sadiq M.

    Published 2004
    “…In this work, a fast hybrid algorithm is designed to address this problem. The algorithm employs simulated evolution (SE), an iterative search heuristic that comprises three steps: evaluation, selection and allocation. …”
    Get full text
    Get full text
    article
  13. 733

    Reliability and fault tolerance based topological optimization of computer networks - part I: enumerative techniques by Abd-El-Barr, Mostafa

    Published 2003
    “…Experimental results obtained from a set of randomly generated networks using the proposed algorithms are presented and compared to those obtained using existing techniques. …”
    Get full text
    Get full text
    article
  14. 734
  15. 735

    Faces in the crowd by Abu-Khzam, Faisal N.

    Published 2017
    “…We show how to obtain an outerplanar subgraph of a graph of disk dimension k by removing at most 2k − 2 vertices. We use this reduction technique to obtain a tree-decomposition of width at most 2k and a linear-time 3-approximation algorithm for the pathwidth problem on graphs of fixed disk dimension. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  16. 736

    Dynamic single node failure recovery in distributed storage systems by Itani, M.

    Published 2017
    “…To minimize the system repair cost, we formulate our problem using incidence matrices and solve it heuristically using genetic algorithms for all possible cases of single node failures. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  17. 737
  18. 738
  19. 739

    Identity and Aggregate Signature-Based Authentication Protocol for IoD Deployment Military Drone by Saeed Ullah Jan (9079260)

    Published 2021
    “…Nonetheless, the performance analysis section will be executed using the algorithmic big-O notation. The results show that these protocols are verifiably protected in the ROM and ROR model using the CDHP.…”
  20. 740

    Assessing the potential of network reconfiguration to improve distributed generation hosting capacity in active distribution systems by Margossian, Harag

    Published 2014
    “…This work further proposes an algorithm to break-down the large problem size when many periods have to be considered. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article