Search alternatives:
processing algorithm » processing algorithms (Expand Search)
element processing » melt processing (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
Showing 1 - 20 results of 138 for search '(((( elements _ algorithm ) OR ( relevant data algorithm ))) OR ( element processing algorithm ))', query time: 0.12s Refine Results
  1. 1
  2. 2

    Nonlinear analysis of shell structures using image processing and machine learning by M.S. Nashed (16392961)

    Published 2023
    “…The proposed approach can be significantly more efficient than training a machine learning algorithm using the raw numerical data. To evaluate the proposed method, two different structures are assessed where the training data is created using nonlinear finite element analysis. …”
  3. 3

    Multi-Objective Optimisation of Injection Moulding Process for Dashboard Using Genetic Algorithm and Type-2 Fuzzy Neural Network by Mohammad Reza Chalak Qazani (13893261)

    Published 2024
    “…Additionally, the multi-objective genetic algorithm (MOGA) was utilised to extract the most optimal parameters for the injection moulding process, aiming to minimise shear and residual stress and thereby increase the resistance of the final product. …”
  4. 4

    An improved kernelization algorithm for r-Set Packing by Abu-Khzam, Faisal N.

    Published 2010
    “…Such parameterized reductions are known as kernelization algorithms, and a reduced instance is called a problem kernel. …”
    Get full text
    Get full text
    Get full text
    article
  5. 5

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

    Published 2010
    “…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into an equivalent one whose size depends only on the input parameter(s). …”
    Get full text
    Get full text
    Get full text
    article
  6. 6
  7. 7

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

    Published 2002
    “…Our model uses a large number of simple processing elements or neurons, based on the McCulloch-Pitts binary neuron. …”
    Get full text
    Get full text
    article
  8. 8

    Variable Selection in Data Analysis: A Synthetic Data Toolkit by Mitra, Rohan

    Published 2024
    “…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …”
    Get full text
    article
  9. 9
  10. 10
  11. 11

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

    Published 2024
    “…UniBFS exploits the inherent characteristic of binary algorithms-binary coding-to search the entire problem space for identifying relevant features while avoiding irrelevant ones. …”
  12. 12
  13. 13

    Auto-indexing Arabic texts based on association rule data mining. (c2015) by Rouba G. Nasrallah

    Published 2015
    “…Our model denotes extracting new relevant words by relating those chosen by the previous classical methods, to new words using data mining rules. …”
    Get full text
    Get full text
    masterThesis
  14. 14

    On the Optimization of Band Gaps in Periodic Waveguides by Jamil Renno (14070771)

    Published 2025
    Subjects: “…Nature-inspired optimization algorithms…”
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19

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

    Published 1993
    “…The authors report on the design of a digital feedback control system to provide null steering by controlling the array element positions automatically. The array comprises a signal processor, digital control algorithm (PID), stepper motors, shaft encoders, actuators and multiplexers. …”
    Get full text
    Get full text
    article
  20. 20

    Adaptive bias simulated evolution algorithm for placement by Youssef, H.

    Published 2001
    “…A new solution is evolved from current solution by relocating some of the solution elements. Elements with lower goodnesses have higher probabilities of getting selected for perturbation. …”
    Get full text
    Get full text
    article