Search alternatives:
per algorithm » deer algorithm (Expand Search), rd algorithm (Expand Search), search algorithm (Expand Search)
elements per » elementi per (Expand Search), elements _ (Expand Search)
finding » findings (Expand Search)
component » components (Expand Search)
per algorithm » deer algorithm (Expand Search), rd algorithm (Expand Search), search algorithm (Expand Search)
elements per » elementi per (Expand Search), elements _ (Expand Search)
finding » findings (Expand Search)
component » components (Expand Search)
-
1
Test case generation for path coverage. (c2000)
Published 2000Get full text
Get full text
masterThesis -
2
Intelligent Rapidly-Exploring Random Tree Star Algorithm
Published 2024Get full text
doctoralThesis -
3
-
4
Data Generation for Path Testing
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 -
5
Mobile Robot Navigation in Dynamic Environments Using an Improved RRT* Approach
Published 2018Get full text
doctoralThesis -
6
DRL-Based UAV Path Planning for Coverage Hole Avoidance: Energy Consumption and Outage Time Minimization Trade-Offs
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. …”
-
7
Optimization of Commercially Off the Shelf (COTS) Electric Propulsion System for Low Speed Fuel Cell UAV
Published 2013Get full text
doctoralThesis -
8
A Novel Hybrid Genetic-Whale Optimization Model for Ontology Learning from Arabic Text
Published 2019“…The algorithm calculates the concept frequency weights using the term frequency weights. …”
Get full text
Get full text
-
9
A Hybrid Deep Learning Model Using CNN and K-Mean Clustering for Energy Efficient Modelling in Mobile EdgeIoT
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. …”
-
10
Correlation Clustering with Overlaps
Published 2020“…We present a heuristic algorithm and a semi-exact algorithm for the Multi-Parameterized Cluster Editing with Vertex Splitting problem. …”
Get full text
Get full text
Get full text
masterThesis -
11
QoS-driven multicast tree generation using tabu search
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 -
12
Multidimensional Gains for Stochastic Approximation
Published 2019“…The proposed algorithms here aim for per-iteration minimization of the mean square estimate error. …”
Get full text
Get full text
Get full text
Get full text
article -
13
Optimal Routing Protocol in Multimedia Wireless Sensor Networks
Published 2011Get full text
doctoralThesis -
14
Simulations of the penetration of 6061-T6511 aluminum targets by spherical-nosed VAR 4340 steel projectiles
Published 2000“…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. …”
Get full text
Get full text
Get full text
article -
15
Evacuation of a highly congested urban city
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 -
16
Assessment of static pile design methods and non-linear analysis of pile driving
Published 2006“…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. …”
Get full text
Get full text
Get full text
masterThesis -
17
On the complexity of multi-parameterized cluster editing
Published 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. …”
Get full text
Get full text
Get full text
Get full text
article -
18
SDODV. (c2018)
Published 2018“…Experimental results prove that SDODV out-performs shortest path and reduces the energy consumption.…”
Get full text
Get full text
Get full text
masterThesis -
19
-
20
On the disk dimension of planar graphs
Published 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. …”
Get full text
Get full text
Get full text
conferenceObject