Search alternatives:
sampling algorithm » scheduling algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
element » elements (Expand Search)
finding » findings (Expand Search)
Showing 181 - 200 results of 225 for search '(( element method algorithm ) OR ((( client sampling algorithm ) OR ( based finding algorithm ))))', query time: 0.12s Refine Results
  1. 181
  2. 182

    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). …”
  3. 183
  4. 184

    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
  5. 185

    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
  6. 186
  7. 187

    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
  8. 188
  9. 189
  10. 190
  11. 191

    MoveSchedule by Zouein, Pierette

    Published 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. …”
    Get full text
    Get full text
    Get full text
    masterThesis
  12. 192

    An Evolutionary Meta-Heuristic for State Justification in Sequential Automatic Test Pattern Generation by El-Maleh, Aiman H.

    Published 2001
    “…In this work, we propose a hybrid approach which uses a combination of evolutionary and deterministic algorithms for state justification. A new method based on Genetic algorithms is proposed, in which we engineer state justification sequences vector by vector. …”
    Get full text
    article
  13. 193

    An evolutionary meta-heuristic for state justification insequential automatic test pattern generation by El-Maleh, A.H.

    Published 2001
    “…In this work, we propose a hybrid approach which uses a combination of evolutionary and deterministic algorithms for state justification. A new method based on Genetic Algorithms is proposed, in which we engineer state justification sequences vector by vector. …”
    Get full text
    Get full text
    article
  14. 194

    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. …”
  15. 195

    Approximate XML structure validation based on document–grammar tree similarity by Tekli, Joe

    Published 2015
    “…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?…”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  16. 196

    Approximate XML structure validation technical report by Tekli, Joe

    Published 2014
    “…In this paper, we propose an original method for measuring the structural similarity between an XML document and an XML grammar (DTD or XSD), considering their most common operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes (e.g., ?…”
    Get full text
    Get full text
    Get full text
    article
  17. 197
  18. 198

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

    Published 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. …”
    Get full text
    Get full text
    Get full text
    article
  19. 199

    A Novel Deep Learning Technique for Detecting Emotional Impact in Online Education by Abu Zitar, Raed

    Published 2022
    “…The main aim of this paper is to map the relationship between teaching practices and student learning based on emotional impact. Facial recognition algorithms extract helpful information from online platforms as image classification techniques are applied to detect the emotions of student and/or teacher faces. …”
    Get full text
  20. 200

    Dynamic Cyber Resilience of Interdependent Critical Information Infrastructures by JUMA, MAZEN GHAZI

    Published 2021
    “…The technology stack was also enhanced with three new algorithms and five protocols. The proposed solution was optimized using the iterative four-objective cycle based on previous primary phase results. …”
    Get full text