Test case generation for path coverage. (c2000) حسب Salame, Miran

احصل على النص الكامل
احصل على النص الكامل

Intelligent Rapidly-Exploring Random Tree Star Algorithm حسب Ahmed, Khidir Galal Eldin Khidir

احصل على النص الكامل

Modified arithmetic optimization algorithm for drones measurements and tracks assignment problem حسب Abu Zitar, Raed

احصل على النص الكامل

Data Generation for Path Testing حسب Mansour, Nashat

"…We present two stochastic search algorithms for generating test cases that execute specified paths in a program. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Mobile Robot Navigation in Dynamic Environments Using an Improved RRT* Approach حسب Mohammed, Hussein Ali

احصل على النص الكامل

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

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

Optimization of Commercially Off the Shelf (COTS) Electric Propulsion System for Low Speed Fuel Cell UAV حسب Zulkifli, Muhammad

احصل على النص الكامل

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

"…The algorithm calculates the concept frequency weights using the term frequency weights. …"
احصل على النص الكامل
احصل على النص الكامل

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

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

Correlation Clustering with Overlaps حسب Fakhereldine, Amin

"…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

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

Multidimensional Gains for Stochastic Approximation حسب Saab, Samer S.

"…The proposed algorithms here aim for per-iteration minimization of the mean square estimate error. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Optimal Routing Protocol in Multimedia Wireless Sensor Networks حسب Al-Zurba, Hiba

احصل على النص الكامل

Simulations of the penetration of 6061-T6511 aluminum targets by spherical-nosed VAR 4340 steel projectiles حسب Warren, Thomas

"…In this paper a forcing function which is derived from a spherical-cavity expansion (SCE) analysis has been implemented in a transient dynamic finite element code. This implementation is capable of computing the structural and component responses of a projectile due to a three dimensional penetration event. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

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

Assessment of static pile design methods and non-linear analysis of pile driving حسب Abou-Jaoude, Grace G.

"…The pile/soil interaction system is described by a mass/spring/dashpot system where the properties of each component are derived from rigorous analytical solutions or finite element analysis. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

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

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

SDODV. (c2018) حسب Assi, Maram

"…Experimental results prove that SDODV out-performs shortest path and reduces the energy consumption.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Regression testing C# programs. (c2007) حسب Staitieh, Wael

احصل على النص الكامل
احصل على النص الكامل

On the disk dimension of planar graphs حسب Abu-khzam, Faisal

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