بدائل البحث:
encoding algorithm » cosine algorithm (توسيع البحث)
deer algorithm » search algorithm (توسيع البحث)
finding » findings (توسيع البحث)
يعرض 161 - 180 نتائج من 209 نتيجة بحث عن '(( elementary deer algorithm ) OR ((( data encoding algorithm ) OR ( based finding algorithm ))))*', وقت الاستعلام: 0.09s تنقيح النتائج
  1. 161
  2. 162

    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. …"
  3. 163

    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
  4. 164

    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
  5. 165
  6. 166
  7. 167

    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). …"
  8. 168
  9. 169

    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. …"
  10. 170
  11. 171
  12. 172

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

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

    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. 175
  16. 176
  17. 177

    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
  18. 178

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

    Damage assessment and recovery from malicious transactions using data dependency for defensive information warfare حسب Haraty, Ramzi A.

    منشور في 2007
    "…To make the process of damage assessment and recovery fast and efficient and in order not to scan the whole log, researchers have proposed different methods for segmenting the log, and accordingly presented different damage assessment and recovery algorithms. Since even segmenting the log into clusters may not solve the problem, as clusters/segments may grow to be humongous in size, this is in case of high data/transaction dependency, we suggest a method for segmenting the log into clusters and its sub-clusters; i.e, segmenting the cluster; based on exact data dependency [12], into sub-clusters; based on two different criteria: number of data items or space occupied. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article