يعرض 161 - 180 نتائج من 212 نتيجة بحث عن '(( elements per algorithm ) OR ((( data encoding algorithm ) OR ( based finding algorithm ))))*', وقت الاستعلام: 0.09s تنقيح النتائج
  1. 161

    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. 162
  3. 163

    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. 164
  5. 165

    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. 166

    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. 167

    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. 168
  9. 169
  10. 170

    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. 171
  12. 172

    The Frontiers of Deep Reinforcement Learning for Resource Management in Future Wireless HetNets: Techniques, Challenges, and Research Directions حسب Abdulmalik Alwarafy (17984104)

    منشور في 2022
    "…Then, we provide a comprehensive review of the most widely used DRL algorithms to address RRAM problems, including the value- and policy-based algorithms. …"
  13. 173
  14. 174
  15. 175

    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
  16. 176

    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
  17. 177

    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
  18. 178
  19. 179
  20. 180

    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