يعرض 1 - 20 نتائج من 290 نتيجة بحث عن '(((( relevant data algorithm ) OR ( complex search algorithm ))) OR ( level using algorithm ))', وقت الاستعلام: 0.14s تنقيح النتائج
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    A bounded search tree algorithm for parameterized حسب Abu-Khzam, Faisal N.

    منشور في 2008
    "…This paper builds on previous work of the authors and employs a structure theorem of Aksionov et al., with a detailed case analysis, to produce a face cover algorithm that runs in O(k4.6056+n2) time. We also point to the tight connections with red–blue dominating set on planar graphs via the annotated version of face cover that we consider in our search tree algorithm. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  6. 6

    The buffered work-pool approach for search-tree based optimization algorithms حسب Abu-Khzam, Faisal N.

    منشور في 2017
    "…This new trend has been motivated by hardness of approximation results that appeared in the last decade, and has taken a great boost by the emergence of parameterized complexity theory. Exact algorithms often follow the classical search-tree based recursive backtracking strategy. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  7. 7

    Improved Reptile Search Algorithm by Salp Swarm Algorithm for Medical Image Segmentation حسب Abualigah, Laith

    منشور في 2023
    "…This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding, called RSA-SSA. …"
    احصل على النص الكامل
  8. 8

    An Evolutionary Algorithm for the Allocation Problem in High-Level Synthesis حسب Harmanani, Haidar

    منشور في 2005
    "…This paper presents an evolutionary algorithm to solve the datapath allocation problem in high-level synthesis. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  9. 9
  10. 10

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

    منشور في 2023
    "…BERT generates a 768-dimensional vector for each record, which introduces significant time complexity during computation. Additionally, our proposed model optimizes the features using a genetic algorithm. …"
  11. 11
  12. 12

    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
  13. 13
  14. 14
  15. 15

    Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem حسب Denis Alicic (23073484)

    منشور في 2025
    "…We propose a twofold contribution: first, an adaptive greedy algorithm that generates high-quality initial solutions, achieving markedly better results than traditional constructive heuristics at comparable computational costs; and second, the adaptation of the Matheuristic Fixed Set Search (MFSS) to the TSCFLP. …"
  16. 16
  17. 17
  18. 18

    Scheduling and allocation in high-level synthesis using stochastic techniques حسب Sait, Sadiq M.

    منشور في 2020
    "…In this work, a unique approach to scheduling and allocation problem using the genetic algorithm (GA) is described. This approach is different from a previous attempt using GA (Wehn et al., IFIP Working Conference on Logic and Architecture Synthesis, Paris, 1990, pp. 47–56) in many respects. …"
    احصل على النص الكامل
    article
  19. 19

    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. …"
  20. 20