Showing 1 - 20 results of 34 for search '(( element cscap algorithm ) OR ((( joint modeling algorithm ) OR ( path finding algorithm ))))', query time: 0.12s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    Data Generation for Path Testing by Mansour, Nashat

    Published 2004
    “…We present two stochastic search algorithms for generating test cases that execute specified paths in a program. …”
    Get full text
    Get full text
    Get full text
    article
  6. 6

    Label dependency modeling in Multi-Label Naïve Bayes through input space expansion by PKA Chitra (21749216)

    Published 2024
    “…We subject our enhanced iMLNB model to a rigorous empirical evaluation, utilizing six benchmark datasets. …”
  7. 7
  8. 8
  9. 9

    Joint BS Assignment and End-to-End Scheduling for Wireless Cellular Networks with Heterogeneous Services by Saad, Walid

    Published 2010
    “…In this work, we extend the end-to-end scheduling approach by designing and evaluating a joint scheduling and BS assignment algorithm in order to further improve the system performance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  10. 10

    Joint computing, communication and cost-aware task offloading in D2D-enabled Het-MEC by Abbas, Nadine

    Published 2022
    “…Furthermore, we propose a low-complexity algorithm that generates high performance results and can be applied for large-scale networks. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  11. 11

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

    Published 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. …”
  12. 12

    A Novel Hybrid Genetic-Whale Optimization Model for Ontology Learning from Arabic Text by M. Ghoniem , Rania

    Published 2019
    “…The algorithm calculates the concept frequency weights using the term frequency weights. …”
    Get full text
    Get full text
  13. 13

    Spatially-Distributed Missions With Heterogeneous Multi-Robot Teams by Eduardo Feo-Flushing (23276023)

    Published 2021
    “…We define the mission planning problem through a model including multiple sub-problems that are addressed jointly: task selection and allocation, task scheduling, task routing, control of agent proximity over time. …”
  14. 14

    Optimum sensors allocation for drones multi-target tracking under complex environment using improved prairie dog optimization by Abu Zitar, Raed

    Published 2024
    “…The Extended Kalman Filter (EKF) is used for state estimation with proper clutter and detection models. Since we use Multi-objects to track, the Joint Probability Distribution Function (JPDA) estimates the best measurement values with a preset gating threshold. …”
    Get full text
  15. 15

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

    Published 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. …”
  16. 16
  17. 17
  18. 18

    QoS-driven multicast tree generation using tabu search by Youssef, H.

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

    Evacuation of a highly congested urban city by El Khoury, John

    Published 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. …”
    Get full text
    Get full text
    Get full text
    conferenceObject