Showing 181 - 200 results of 606 for search '(( element method algorithm ) OR ((( data finding algorithm ) OR ( based methods algorithm ))))', query time: 0.14s Refine Results
  1. 181
  2. 182
  3. 183

    The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of HQNNs by Muhammad Kashif (3923483)

    Published 2023
    “…One of the prominent challenges lies in the presence of barren plateaus (BP) in QML algorithms, particularly in quantum neural networks (QNNs). …”
  4. 184

    A data envelopment analysis model for opinion leaders’ identification in social networks by Hamed Baziyad (19273738)

    Published 2024
    “…Social Network Analysis (SNA)-based OLs finding methods deal with a considerable amount of data due to using entire relationships between all of the users in a network, which makes the algorithms time-consuming. …”
  5. 185

    Integrating Genetic Algorithms, Tabu Search, And Simulated Annealing For The Unit Commitment Problem by Montawy, A.H.

    Published 2020
    “…This paper presents a new algorithm based on integrating genetic algorithms, tabu search and simulated annealing methods to solve the unit commitment problem. …”
    Get full text
    article
  6. 186

    A new family of multi-step quasi-Newton algorithms for unconstrained optimization by Obeid, Samir

    Published 1999
    “…This work aims at ensuring smoothness of interpolation in both the iterate and the gradient spaces in the so-called multi-step quasi-Newton methods. It concentrates on deriving a variable-metric family of minimum curvature algorithms for unconstrained optimization. …”
    Get full text
    Get full text
    article
  7. 187

    A new tabu search algorithm for the long-term hydro scheduling problem by Mantawy, A.H.

    Published 2002
    “…The algorithm is based on using the short-term memory of the tabu search (TS) approach to solve the nonlinear optimization problem in continuous variables of the LTHSP. …”
    Get full text
    Get full text
    article
  8. 188

    New Fast Arctangent Approximation Algorithm for Generic Real-Time Embedded Applications by Mohieddine Benammar (18103039)

    Published 2019
    “…Those are the iterative coordinate rotational digital computer (CORDIC), the lookup tables (LUTs)-based, and the rational formulae techniques. This paper presents a novel technique that combines the advantages of both rational formulae and LUT approximation methods. …”
  9. 189

    Performance comparison of variable-stepsize IMEX SBDF methods on advection-diffusion-reaction models by Raed Ali Ayesh Marabeh (21142247)

    Published 2025
    “…We develop an adaptive time-stepping and error control algorithm for VSSBDF methods up to fourth order based on a step-doubling refinement technique using estimates of the local truncation errors. …”
  10. 190

    UAV Trajectory Planning for Data Collection from Time-Constrained IoT Devices by Samir, Moataz

    Published 2019
    “…To solve it, we first propose the high-complexity branch, reduce and bound (BRB) algorithm to find the global optimal solution for relatively small scale scenarios. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  11. 191

    A time-domain algorithm for the analysis of second-harmonicgeneration in nonlinear optical structures by Al-Sunaidi, M. A.

    Published 2000
    “…A time-domain simulator of integrated optical structures containing second-order nonlinearities is presented. The simulation algorithm is based on nonlinear wave equations representing the propagating fields and is solved using the finite-difference time-domain method. …”
    article
  12. 192

    A time-domain algorithm for the analysis of second-harmonicgeneration in nonlinear optical structures by Alsunaidi, M.A.

    Published 2000
    “…A time-domain simulator of integrated optical structures containing second-order nonlinearities is presented. The simulation algorithm is based on nonlinear wave equations representing the propagating fields and is solved using the finite-difference time-domain method. …”
    Get full text
    Get full text
    article
  13. 193

    BioNetApp: An interactive visual data analysis platform for molecular expressions by Ali M. Roumani (18615124)

    Published 2019
    “…BioNetApp also provides data clustering based on molecular concentrations using Self Organizing Maps (SOM), K-Means, K-Medoids, and Farthest First algorithms.…”
  14. 194
  15. 195
  16. 196

    Automatic keyword extraction from a real estate classifieds data set by Devassy, Dibin

    Published 2011
    “…We begin with designing data cleansing algorithms to verify different attributes of the real estate classified. …”
    Get full text
  17. 197

    UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data by Behrouz Ahadzadeh (19757022)

    Published 2024
    “…Moreover, the study proposes a hybrid algorithm that combines UniBFS with two filter-based FS methods, ReliefF and Fisher, to identify pertinent features during the global search phase. …”
  18. 198

    Efficient multi-objective neural architecture search framework via policy gradient algorithm by Bo Lyu (16522643)

    Published 2024
    “…<p>Differentiable architecture search plays a prominent role in Neural Architecture Search (NAS) and exhibits preferable efficiency than traditional heuristic NAS methods, including those based on evolutionary algorithms (EA) and reinforcement learning (RL). …”
  19. 199

    Comparative analysis of metaheuristic load balancing algorithms for efficient load balancing in cloud computing by Jincheng Zhou (1887307)

    Published 2023
    “…The simulation results show the performance of various Meta-heuristic Load balancing methods, based on performance factors. The Particle swarm optimization method performs better in improving makespan, flow time, throughput time, response time, and degree of imbalance.…”
  20. 200

    A method for efficient mapping and reliable routing for NoC architectures with minimum bandwidth and area by Harmanani, Haidar M.

    Published 2017
    “…The method proposes a new efficient routing algorithm that minimizes blocking while increasing bandwidth throughput. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject