يعرض 1 - 19 نتائج من 19 نتيجة بحث عن '(((( element mould algorithm ) OR ( element mesh algorithm ))) OR ( path finding algorithm ))', وقت الاستعلام: 0.10s تنقيح النتائج
  1. 1
  2. 2

    Multi-Objective Optimisation of Injection Moulding Process for Dashboard Using Genetic Algorithm and Type-2 Fuzzy Neural Network حسب Mohammad Reza Chalak Qazani (13893261)

    منشور في 2024
    "…Additionally, the multi-objective genetic algorithm (MOGA) was utilised to extract the most optimal parameters for the injection moulding process, aiming to minimise shear and residual stress and thereby increase the resistance of the final product. …"
  3. 3
  4. 4
  5. 5

    Data Generation for Path Testing حسب Mansour, Nashat

    منشور في 2004
    "…We present two stochastic search algorithms for generating test cases that execute specified paths in a program. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  6. 6
  7. 7

    DRL-Based UAV Path Planning for Coverage Hole Avoidance: Energy Consumption and Outage Time Minimization Trade-Offs حسب Bahareh Jafari (22501715)

    منشور في 2025
    "…By deploying a deep reinforcement learning algorithm, we find optimal UAV paths based on the two families of trajectories: spiral and oval curves, to tackle different design considerations and constraints, in terms of QoS, energy consumption and coverage hole avoidance. …"
  8. 8
  9. 9

    A Hybrid Deep Learning Model Using CNN and K-Mean Clustering for Energy Efficient Modelling in Mobile EdgeIoT حسب Dhananjay Bisen (19482454)

    منشور في 2023
    "…<p dir="ltr">In mobile edge computing (MEC), it is difficult to recognise an optimum solution that can perform in limited energy by selecting the best communication path and components. This research proposed a hybrid model for energy-efficient cluster formation and a head selection (E-CFSA) algorithm based on convolutional neural networks (CNNs) and a modified k-mean clustering (MKM) method for MEC. …"
  10. 10

    A survey and comparison of wormhole routing techniques in a meshnetworks حسب Al-Tawil, K.M.

    منشور في 1997
    "…These multiprocessing systems consist of processing elements or nodes which are connected together by interconnection networks in various topologies. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  11. 11

    QoS-driven multicast tree generation using tabu search حسب Youssef, H.

    منشور في 2020
    "…The problem to be solved is to find a minimum cost multicast treee where each source to destination path is contrained by a delay bound. …"
    احصل على النص الكامل
    article
  12. 12
  13. 13

    Evacuation of a highly congested urban city حسب El Khoury, John

    منشور في 2017
    "…The algorithm uses Dijkstras algorithm to find the shortest path(s) and a modified greedy algorithm to assign maximum flows to selected paths given a specific schedule per time interval. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    conferenceObject
  14. 14

    SDODV. (c2018) حسب Assi, Maram

    منشور في 2018
    "…Experimental results prove that SDODV out-performs shortest path and reduces the energy consumption.…"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  15. 15

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

    A Full-System Approach of the Elastohydrodynamic Line/Point Contact Problem حسب Habchi, Wassim

    منشور في 2008
    "…The use of the finite element method allows the use of variable unstructured meshing and different types of elements within the same model which leads to a reduced size of the problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  17. 17

    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. …"
    احصل على النص الكامل
  18. 18

    Nouveaux points de coupure et primitives pour les préoccupations de renforcement de sécurité حسب Mourad, Azzam

    منشور في 2009
    "…The first one is the GAFlow, the Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, the Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcuts of interest. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  19. 19

    New aspect-oriented constructs for security hardening concerns حسب Mourad, Azzam

    منشور في 2009
    "…The first one is the GAFlow, Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcut of interest. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article