Showing 181 - 200 results of 234 for search '(( element would algorithm ) OR ((( data code algorithm ) OR ( based finding algorithm ))))', query time: 0.12s Refine Results
  1. 181

    Computational evluation of protein energy functions by Mansour, Nashat

    Published 2014
    “…Also, we propose an approach based on a simulated annealing algorithm to find a better combination of energy terms, by assigning different weights to the terms, for the purpose of improving the capability of the computational prediction methods.…”
    Get full text
    Get full text
    Get full text
    conferenceObject
  2. 182

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

    Published 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. …”
    Get full text
  3. 183
  4. 184

    Heuristics for graph decomposition by Mansour, N.

    Published 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. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  5. 185

    Definition and selection of fuzzy sets in genetic‐fuzzy systems using the concept of fuzzimetric arcs by Kouatli, Issam

    Published 2008
    “…Design/methodology/approach – The design was based on two principles: selection and optimization. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  6. 186

    A collaborative filtering recommendation framework utilizing social networks by Aamir Fareed (17019087)

    Published 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. …”
  7. 187

    Genetic Fuzzimetric Technique (GFT) by Kouatli, Issam

    Published 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. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  8. 188

    DSDM: A Distributed Service Discovery Model for Manets by Artail, Hassan

    Published 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. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  9. 189
  10. 190
  11. 191

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

    Published 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). …”
  12. 192
  13. 193

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

    Published 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. …”
  14. 194

    SDODV. (c2018) by Assi, Maram

    Published 2018
    “…Therefore, the routing problem designated to find and maintain an optimal route between two nodes is not very straight forward. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  15. 195

    Dynamic Layout Planning Using a Hybrid Incremental Solution Method by Zouein, Pierrette

    Published 1999
    “…Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. …”
    Get full text
    Get full text
    Get full text
    article
  16. 196
  17. 197

    On the disk dimension of planar graphs by Abu-khzam, Faisal

    Published 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. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  18. 198
  19. 199
  20. 200