يعرض 1 - 20 نتائج من 94 نتيجة بحث عن '(((( relevant data algorithm ) OR ( elements study algorithm ))) OR ( case scheduling algorithm ))', وقت الاستعلام: 0.13s تنقيح النتائج
  1. 1
  2. 2
  3. 3

    Power-constrained system-on-a-chip test scheduling using a genetic algorithm حسب Harmanani, Haidar M.

    منشور في 2006
    "…This paper presents an efficient approach for the test scheduling problem of core-based systems based on a genetic algorithm. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  4. 4

    Variable Selection in Data Analysis: A Synthetic Data Toolkit حسب Mitra, Rohan

    منشور في 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). …"
    احصل على النص الكامل
    article
  5. 5

    Optimized Load-Scheduling Algorithm for CubeSat's Electric Power System Management Considering Communication Link حسب Bayan Hussein (16904856)

    منشور في 2023
    "…The solution obtained shows that the proposed scheduling algorithm meets the communication system's requirements while conserving power and energy resources.…"
  6. 6

    Efficient Prioritization and Processor Selection Schemes for HEFT Algorithm: A Makespan Optimizer for Task Scheduling in Cloud Environment حسب Sachi Gupta (19560268)

    منشور في 2022
    "…Among these methods, the Heterogeneous Earliest Finish Time (HEFT) algorithm is recognized to produce optimal outcomes in a shorter time period for scheduling tasks in a heterogeneous environment. …"
  7. 7
  8. 8

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

    منشور في 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. …"
  9. 9

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

    منشور في 2015
    "…Our model denotes extracting new relevant words by relating those chosen by the previous classical methods, to new words using data mining rules. …"
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  10. 10
  11. 11
  12. 12
  13. 13

    Incremental Genetic Algorithm حسب Mansour, Nashat

    منشور في 2006
    "…Classical Genetic Algorithms (CGA) are known to find good sub-optimal solutions for complex and intractable optimization problems. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  14. 14

    An efficient method for the open-shop scheduling problem using simulated annealing حسب Harmanani, Haidar M.

    منشور في 2016
    "…This paper presents a simulated annealing algorithm in order to solve the nonpreemptive open-shop scheduling problem with the objective of minimizing the makespan. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  15. 15

    Monitoring Bone Density Using Microwave Tomography of Human Legs: A Numerical Feasibility Study حسب Alkhodari, Mohanad Ahmed

    منشور في 2021
    "…This study was performed using an in-house finite-element method contrast source inversion algorithm (FEM-CSI). …"
    احصل على النص الكامل
    article
  16. 16

    A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems حسب Raka Jovanovic (17947838)

    منشور في 2021
    "…The GRASP algorithm is used for case studies on several public transport systems having various properties and sizes. …"
  17. 17
  18. 18
  19. 19

    Optimizing Document Classification: Unleashing the Power of Genetic Algorithms حسب Ghulam Mustafa (458105)

    منشور في 2023
    "…Additionally, our proposed model optimizes the features using a genetic algorithm. Optimal feature selection performances a crucial role in this domain, enhancing the overall accuracy of the document classification system while reducing the time complexity associated with selecting the most relevant features from this large-dimensional space. …"
  20. 20