بدائل البحث:
method algorithm » mould algorithm (توسيع البحث)
finding » findings (توسيع البحث)
يعرض 201 - 220 نتائج من 249 نتيجة بحث عن '(( elements method algorithm ) OR ((( task scheduling algorithm ) OR ( based finding algorithm ))))', وقت الاستعلام: 0.11s تنقيح النتائج
  1. 201

    Using Text Mining and Clustering Techniques on Tweets to Discover Trending Topics in Dubai حسب Hamadeh, Moutaz Wajih

    منشور في 2015
    "…Tweets corpus of Dubai were collected, they were presented through the bag of words model using TF-IDF weighting scheme, after that the output of text transformation was introduced to k-means clustering algorithm with cosine similarity measure. Findings indicate that heuristic evaluation techniques are not so helpful in this domain; also, the model has generated interesting clusters about trending topics and events in Dubai. …"
    احصل على النص الكامل
  2. 202
  3. 203

    Heuristics for graph decomposition حسب Mansour, N.

    منشور في 2000
    "…The heuristic procedure that we propose is based on a hybrid genetic algorithm (HGA) for decomposing a graph followed by an iterative improvement heuristic for tuning the HGA's results. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  4. 204
  5. 205

    A collaborative filtering recommendation framework utilizing social networks حسب Aamir Fareed (17019087)

    منشور في 2023
    "…The current study proposes a collaborative filtering recommendation framework that employs social networks to generate more precise and pertinent recommendations. The framework is based on a modified version of the user-based collaborative filtering algorithm, which computes user similarity based on their ratings and social connections. …"
  6. 206

    Genetic Fuzzimetric Technique (GFT) حسب Kouatli, Issam

    منشور في 2012
    "…This new proposed technique is termed as Genetic Fuzzimetric Technique (GFT) where the strength of this technique is based on the systematic approach of defining fuzzy sets (variables), cross-over and mutation of these variables in order to find the optimized performance. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  7. 207

    DSDM: A Distributed Service Discovery Model for Manets حسب Artail, Hassan

    منشور في 2008
    "…The designed system is based on storing service descriptions in selected nodes that are searched in accordance to a proposed Minimum Distance Packet Forwarding (MDPF) algorithm. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  8. 208
  9. 209
  10. 210

    A matheuristic approach for solving the 2-connected dominating set problem حسب Raka Jovanovic (17947838)

    منشور في 2019
    "…The goal of the proposed method is to find near optimal solutions for large graphs. The algorithm is based on a Greedy Randomized Adaptive Search Procedure (GRASP). …"
  11. 211
  12. 212

    SDODV. (c2018) حسب Assi, Maram

    منشور في 2018
    "…Therefore, the routing problem designated to find and maintain an optimal route between two nodes is not very straight forward. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  13. 213

    Dynamic Layout Planning Using a Hybrid Incremental Solution Method حسب Zouein, Pierrette

    منشور في 1999
    "…Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  14. 214

    On the disk dimension of planar graphs حسب Abu-khzam, Faisal

    منشور في 2011
    "…More significantly, we devise a direct and highly practical linear-time algorithm to decide whether an arbitrary graph has fixed disk dimension k or less. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  15. 215
  16. 216
  17. 217

    Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying حسب Tekli, Joe

    منشور في 2023
    "…Many efforts have been deployed by the IR community to extend freetext query processing toward semi-structured XML search. Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  18. 218

    MoveSchedule حسب Zouein, Pierette

    منشور في 1995
    "…The layout construction algorithm that underlies MoveSchedule uses Constraint Satisfaction to find the set of all positions that meet the constraints on resources' positions and Linear Programming to find the optimal positions that minimize resource transportation and relocation costs. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  19. 219

    Defining quantitative rules for identifying influential researchers: Insights from mathematics domain حسب Ghulam Mustafa (458105)

    منشور في 2024
    "…The rules were developed for each parameter category using the Decision Tree Algorithm, which achieved an average accuracy of 70 to 75 percent for identifying awardees in mathematics domains. …"
  20. 220

    Application of Metastructures for Targeted Low-Frequency Vibration Suppression in Plates حسب Ratiba F. Ghachi (14152455)

    منشور في 2022
    "…<h2>Purpose</h2> <p>We present an approach that combines finite element analysis and genetic algorithms to find the optimal configuration of local resonators created in the host structure to suppress their vibration in a target low-frequency range. …"