يعرض 1 - 20 نتائج من 26 نتيجة بحث عن '(( path finding algorithm ) OR ((( element per algorithm ) OR ( elements component algorithm ))))', وقت الاستعلام: 0.12s تنقيح النتائج
  1. 1
  2. 2
  3. 3
  4. 4

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

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

    Correlation Clustering with Overlaps حسب Fakhereldine, Amin

    منشور في 2020
    "…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  11. 11

    On the complexity of multi-parameterized cluster editing حسب Abu-Khzam, Faisal

    منشور في 2017
    "…In other words, Cluster Editing can be solved efficiently when the number of false positives/negatives per single data element is expected to be small compared to the minimum cluster size. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    article
  12. 12
  13. 13

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

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

    SDODV. (c2018) حسب Assi, Maram

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

    Optical recognition of electrical circuit drawings حسب Boraie, M.T.

    منشور في 1997
    "…The system uses computer vision techniques to analyze the circuit's drawing and produces a circuit description program suitable for analysis by circuit analysis programs such as SPICE. The algorithm proposed uses a variety of machine vision techniques to locate the circuit nodes and isolate the circuit components. …"
    احصل على النص الكامل
    احصل على النص الكامل
    article
  18. 18

    An Artificial Intelligence Approach for Predictive Maintenance in Electronic Toll Collection System حسب Alkhatib, Osama

    منشور في 2019
    "…Historical data of Dubai Toll Collection System is utilized to investigate multiple machine learning algorithms. Experiment is performed using Azure Machine Learning (ML) platform to test and assess the most efficient model that would predict the failure of system elements and predict the abnormality of the operation. …"
    احصل على النص الكامل
  19. 19
  20. 20

    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