Search alternatives:
deer algorithm » search algorithm (Expand Search)
developing rd » developing a (Expand Search), developing _ (Expand Search)
rd algorithm » _ algorithms (Expand Search)
element deer » elementi per (Expand Search)
finding » findings (Expand Search)
deer algorithm » search algorithm (Expand Search)
developing rd » developing a (Expand Search), developing _ (Expand Search)
rd algorithm » _ algorithms (Expand Search)
element deer » elementi per (Expand Search)
finding » findings (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
Application of Red Deer Algorithm in Optimizing Complex functions
Published 2021“…The Red Deer algorithm (RDA), a recently developed population-based meta-heuristic algorithm, is examined in this paper with the optimization task of complex functions. …”
Get full text
Get full text
-
5
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 -
6
Mobile Robot Navigation in Dynamic Environments Using an Improved RRT* Approach
Published 2018Get full text
doctoralThesis -
7
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. …”
-
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
-
10
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. …”
-
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
Optimal Routing Protocol in Multimedia Wireless Sensor Networks
Published 2011Get full text
doctoralThesis -
13
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 -
14
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 -
15
Computer-aided detection of Melanoma using geometric features
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject -
16
Video features with impact on user quality of experience
Published 2021Get full text
Get full text
Get full text
Get full text
conferenceObject -
17
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 -
18
Dynamic Cyber Resilience of Interdependent Critical Information Infrastructures
Published 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. …”
Get full text
-
19
Nouveaux points de coupure et primitives pour les préoccupations de renforcement de sécurité
Published 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. …”
Get full text
Get full text
Get full text
article -
20
New aspect-oriented constructs for security hardening concerns
Published 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. …”
Get full text
Get full text
Get full text
article