Showing 201 - 220 results of 283 for search '(( elements modeling algorithm ) OR ((( data code algorithm ) OR ( based findings algorithm ))))', query time: 0.09s Refine Results
  1. 201

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

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

    Innovative mobile E-healthcare systems by Haraty, Ramzi A.

    Published 2016
    “…In this work, we propose a new cache replacement algorithm—Profit SACCS—that is based on the rule-based least profit value. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  3. 203

    Soft Sensor for NOx Emission using Dynamical Neural Network by Shakil, M.

    Published 2020
    “…Lag space for the model is found by using genetic algorithm to find the best time delayed model. Lag space obtained from the linear model is then used for constriction of the dynamical neural network. …”
    Get full text
    article
  4. 204
  5. 205
  6. 206

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

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

    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. 209
  10. 210
  11. 211
  12. 212
  13. 213

    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). …”
  14. 214

    A novel on design and implementation of hybrid MPPT controllers for solar PV systems under various partial shading conditions by Chakarajamula Hussaian Basha (21633167)

    Published 2024
    “…The studied hybrid optimization MPPT methods are equated in terms of oscillations across MPP, output power extraction, settling time of the MPP, dependency on the PV modeling, operating duty value of the converter, error finding accuracy of MPPT, algorithm complexity, tracking speed, periodic tuning required, and the number of sensing parameters utilized. …”
  15. 215
  16. 216
  17. 217

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

    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
  19. 219
  20. 220

    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