Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data tracking » radar tracking (Expand Search)
element » elements (Expand Search)
Showing 181 - 200 results of 303 for search '(((( data tracking algorithm ) OR ( solved using algorithm ))) OR ( element method algorithm ))', query time: 0.12s Refine Results
  1. 181
  2. 182

    Short-Term Load Forecasting in Active Distribution Networks Using Forgetting Factor Adaptive Extended Kalman Filter by Mena S. ElMenshawy (17983807)

    Published 2023
    “…A few research studies focused on developing data filtering algorithm for the load forecasting process using approaches such as Kalman filter, which has good tracking capability in the presence of noise in the data collection process. …”
  3. 183

    A Full-System Approach of the Elastohydrodynamic Line/Point Contact Problem by Habchi, Wassim

    Published 2008
    “…The use of the finite element method allows the use of variable unstructured meshing and different types of elements within the same model which leads to a reduced size of the problem. …”
    Get full text
    Get full text
    Get full text
    article
  4. 184

    Newton-Raphson based adaptive inverse control scheme for tracking of nonlinear dynamic plants by Shafiq, M.

    Published 2006
    “…The U-model is utilized to design an adaptive inverse controller by using a simple root-solving algorithm of Newton-Raphson. …”
    Get full text
    Get full text
    article
  5. 185

    Unit commitment by tabu search by Mantawy, A.H.

    Published 1998
    “…The problem is divided into two subproblems: a combinatorial optimisation problem and a nonlinear programming problem. The former is solved using the tabu search algorithm (TSA) while the latter problem is solved via a quadratic programming routine. …”
    Get full text
    Get full text
    article
  6. 186
  7. 187

    A linear programming approach for the weighted graph matchingproblem by Almohamad, H.A.

    Published 1993
    “…The linear program is solved using a simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …”
    Get full text
    Get full text
    article
  8. 188

    Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine by Duffuaa, S. O.

    Published 2020
    “…In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. …”
    Get full text
    article
  9. 189
  10. 190

    A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM by Al-Mohamad, HA

    Published 2020
    “…The linear program is solved using a Simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …”
    Get full text
    article
  11. 191

    Corona power loss computation in bundled bipolar conductors by Al-Hamouz, Z.M.

    Published 2000
    “…In this paper, a finite element (FE) based algorithm devoted for the computation of the corona current and hence the corona power loss associated with bundled bipolar high voltage direct current (HVDC) conductors is presented. …”
    Get full text
    Get full text
    article
  12. 192

    Tabu search based circuit optimization by Sait, Sadiq M.

    Published 1998
    “…The problem is formulated as a constrained combinatorial optimization problem and solved using an tabu search algorithm. Only gates on the critical sensitizable paths are considered for optimization. …”
    Get full text
    Get full text
    article
  13. 193

    Could Petrol Stations Play a Key Role in Transportation Electrification? A GIS-Based Coverage Maximization of Fast EV Chargers in Urban Environment by Safak Bayram (16925975)

    Published 2022
    “…The spatial optimization problem is solved using a linear-programming relaxation based MCLP algorithm developed in Python. …”
  14. 194

    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
  15. 195

    Energy removal in dynamical systems through an optimal sequence of constraint application by Issa, Jimmy

    Published 2017
    “…The optimization process is illustrated by means of simple mass-spring and membrane systems and the corresponding problems are solved using a genetic algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  16. 196
  17. 197

    Optimal shunt compensators at nonsinusoidal busbars by El-Amin, I.M.

    Published 1995
    “…The choice of the capacitor value is constrained by the values that may cause resonance. This model was solved employing the penalty function approach and the golden Section Search algorithm for solving the linear load case. …”
    Get full text
    Get full text
    article
  18. 198

    OPTIMAL SHUNT COMPENSATORS AT NON-SINUSOIDAL BUSBARS by El-Amin, I.M.

    Published 2020
    “…The choice of the capacitor value is constrained by the values that may cause resonance. This model was solved employing the penalty function approach and the golden Section Search algorithm for solving the linear load case. …”
    Get full text
    article
  19. 199

    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
  20. 200

    GenDE: A CRF-Based Data Extractor by Kayed, Mohammed

    Published 2020
    “…It verifies the site schema and extracts data from the Web pages using Conditional Random Fields (CRFs). The problem is solved by breaking down an observation sequence (a Web page) into simpler subsequences that will be labeled using CRF. …”
    Get full text
    Get full text