Showing 201 - 220 results of 246 for search '(( elements network algorithm ) OR ((( data code algorithm ) OR ( based finding algorithm ))))', query time: 0.11s Refine Results
  1. 201

    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). …”
  2. 202
  3. 203
  4. 204
  5. 205
  6. 206

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

    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
  8. 208
  9. 209

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

    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
  14. 214

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

    Dynamic single node failure recovery in distributed storage systems by Itani, M.

    Published 2017
    “…With the emergence of many erasure coding techniques that help provide reliability in practical distributed storage systems, we use fractional repetition coding on the given data and optimize the allocation of data blocks on system nodes in a way that minimizes the system repair cost. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  16. 216

    Efficient Seismic Volume Compression using the Lifting Scheme by Khene, M. F.

    Published 2000
    “…In addition, the lifting scheme offers: 1) a dramatic reduction of the required auxiliary memory, 2) an efficient combination with parallel rendering algorithms to perform arbitrary surface and volume rendering for interactive visualization, and 3) an easy integration in the parallel I/O seismic data loading routines. …”
    Get full text
    article
  17. 217

    CubeSat Communication Subsystems: A Review of On-Board Transceiver Architectures, Protocols, and Performance by Amr Zeedan (17983750)

    Published 2023
    “…Nevertheless, several directions for improvements are proposed such as the use of improved channel coding algorithms, Field Programmable Gate Arrays (FPGAs), beamforming, advanced antennas, deployable solar panels, and transition to higher frequency bands. …”
  18. 218
  19. 219

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

    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