Search alternatives:
method algorithm » mould algorithm (Expand Search)
taking algorithm » cosine algorithm (Expand Search)
data finding » data mining (Expand Search), data hiding (Expand Search)
element » elements (Expand Search)
Showing 21 - 40 results of 238 for search '(( element method algorithm ) OR ((( data finding algorithm ) OR ( based taking algorithm ))))', query time: 0.13s Refine Results
  1. 21
  2. 22
  3. 23

    Design of adaptive arrays based on element position perturbations by Dawoud, M.M.

    Published 1993
    “…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …”
    Get full text
    Get full text
    article
  4. 24

    Scalable Nonparametric Supervised Learning for Streaming and Massive Data: Applications in Healthcare Monitoring and Credit Risk by Mohamed Chaouch (17983846)

    Published 2025
    “…Additionally, an online classifier is developed for streaming data, combining online PCA with a kernel-based recursive classifier using a stochastic approximation algorithm. …”
  5. 25
  6. 26
  7. 27
  8. 28
  9. 29
  10. 30
  11. 31
  12. 32

    Bee Colony Algorithm for Proctors Assignment. by Mansour, Nashat

    Published 2015
    “…This problem is intractable, and hence, heuristics algorithms are needed to find good solutions. In this paper, we propose a new solution for the proctor assignment problem based on the Bee Colony meta-heuristic algorithm. …”
    Get full text
    Get full text
    Get full text
    article
  13. 33

    Parallel genetic algorithm for disease-gene association by Mansour, Nashat

    Published 2011
    “…In this work, we combine few successful strategies from the literature and present a parallel genetic algorithm for the Tag SNP Selection problem. Our results compared favorably with those of a recognized tag SNP selection algorithm using three different data sets from the HapMap project.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  14. 34

    A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

    Published 2010
    “…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
    Get full text
    Get full text
    Get full text
    article
  15. 35

    The Effects of Data Mining on Small Businesses in Dubai by AlMutawa, Rasha

    Published 2011
    “…This study was conducted with the aim of finding the benefits of data mining on small businesses and specifically on the real estate sector in Dubai, and the criteria to be used when evaluating and selecting the best tools to consider for such businesses. …”
    Get full text
  16. 36

    A SIMULATED ANNEALING ALGORITHM FOR THE CLUSTERING PROBLEM by Selim, S.Z.

    Published 2020
    “…We also find optimal parameters values for a specific class of data sets and give recommendations on the choice of parameters for general data sets. …”
    Get full text
    article
  17. 37

    A New Hamiltonian Semi-Analytical Approach to Vibration Analysis of Piezoelectric Multi-Layered Plates by Andrianarison, O.

    Published 2024
    “…The whole piezoelectric multilayered plate’s dynamic stiffness is then built, from which its circular frequencies are computed with the help of the Wittrick-Williams algorithm. A detailed discussion is provided on the implementation aspects, followed by some numerical examples to assess the robustness, accuracy and effectiveness of the proposed method. …”
    Get full text
    article
  18. 38

    Trial-based dominance for comparing both the speed and accuracy of stochastic optimizers with standard non-parametric tests by Kenneth V. Price (17877002)

    Published 2023
    “…This paper describes how trial-based dominance can totally order this two-variable dataset of outcomes so that traditional non-parametric methods can determine the better of two algorithms when one is faster, but less accurate than the other, i.e. when neither algorithm dominates. …”
  19. 39

    Spider monkey optimizations: application review and results by Abualigah, Laith

    Published 2024
    “…Optimization algorithms are applied to find efficient solutions in different problems in several fields such as the routing in wireless networks, cloud computing, big data, image processing and scheduling, and so forth. …”
    Get full text
  20. 40