Search alternatives:
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
monte algorithm » mould algorithm (Expand Search), control algorithm (Expand Search), cosine algorithm (Expand Search)
complement » implement (Expand Search), complementary (Expand Search)
element » elements (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
monte algorithm » mould algorithm (Expand Search), control algorithm (Expand Search), cosine algorithm (Expand Search)
complement » implement (Expand Search), complementary (Expand Search)
element » elements (Expand Search)
-
1
-
2
CNN and HEVC Video Coding Features for Static Video Summarization
Published 2022Get full text
article -
3
-
4
-
5
-
6
-
7
Automatic Video Summarization Using HEVC and CNN Features
Published 2022Get full text
doctoralThesis -
8
Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing
Published 2024“…The Jaya algorithm's ability to exploit the current best solutions is complemented by the SSO's collaborative search strategy, resulting in a synergistic optimization framework. …”
Get full text
-
9
MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments
Published 2022“…These requirements have motivated the emergence of fog and edge computing to complement the low-privacy and high-latency cloud. The intention behind Fog computing is to place computational servers closer to the user, typically within the city’s vicinity, to reduce latency. …”
-
10
-
11
Autonomous Demand-Side Management in the Future Smart Grid
Published 2016Get full text
doctoralThesis -
12
A novel technique for fast multiplication
Published 1995“…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …”
Get full text
Get full text
article -
13
-
14
The maximum common subgraph problem
Published 2017“…This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
15
Localizing-ground Transmitters Using Airborne Antenna Array
Published 2020Get full text
doctoralThesis -
16
A new approach and faster exact methods for the maximum common subgraph problem
Published 2017“…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. A detailed analysis shows that the proposed algorithm requires O((m+1)n) time, which is a superior worst-case bound to those known for previously-analyzed algorithms in the setting of the MCS problem. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
17
Utilization of AI to Predict Shear Strength Parameters of Soil Based on Their Physical Properties
Published 2025Get full text
doctoralThesis -
18
Analysis of Multi-User-Based UAV System With Outdated CSI
Published 2024“…Optimization of UAV location and altitude is performed through a limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) algorithm to attain minimum OP (MOP). Results illustrate optimal performance dependent on the channel correlation parameters, antenna elements, and fading conditions. …”
-
19
-
20