يعرض 201 - 220 نتائج من 246 نتيجة بحث عن '(( element network algorithm ) OR ((( data code algorithm ) OR ( based finding algorithm ))))', وقت الاستعلام: 0.12s تنقيح النتائج
  1. 201

    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). …"
  2. 202
  3. 203

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

    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
  5. 205
  6. 206

    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
  7. 207
  8. 208
  9. 209
  10. 210
  11. 211

    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
  12. 212

    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. …"
  13. 213

    Dynamic single node failure recovery in distributed storage systems حسب Itani, M.

    منشور في 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. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  14. 214

    Efficient Seismic Volume Compression using the Lifting Scheme حسب Khene, M. F.

    منشور في 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. …"
    احصل على النص الكامل
    article
  15. 215

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

    منشور في 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. …"
  16. 216
  17. 217

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

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

    منشور في 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. …"
    احصل على النص الكامل
  19. 219

    Comprehensive whole genome sequence analyses yields novel genetic and structural insights for Intellectual Disability حسب Farah R. Zahir (18892108)

    منشور في 2017
    "…The <i>de novo</i> assembly resulted in unmasking hidden genome instability that was missed by standard re-alignment based algorithms. We also interrogated regulatory sequence variation for known and hypothesized ID genes and present useful strategies for WGS data analyses for non-coding variation.…"
  20. 220

    Dynamic Cyber Resilience of Interdependent Critical Information Infrastructures حسب JUMA, MAZEN GHAZI

    منشور في 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. …"
    احصل على النص الكامل