Search alternatives:
mining algorithm » cosine algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
complement » implement (Expand Search), complementary (Expand Search)
element » elements (Expand Search)
mining algorithm » cosine algorithm (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling 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
-
9
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
-
10
-
11
MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments
Published 2022“…For MAESTRO, we build an integrated architecture that includes two new scheduling algorithms for assigning computing workloads to FemtoClouds. …”
-
12
-
13
A novel technique for fast multiplication
Published 2020“…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …”
Get full text
article -
14
-
15
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 -
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
-
18
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 -
19
A Literature Review on System Dynamics Modeling for Sustainable Management of Water Supply and Demand
Published 2023“…The solution approaches included the genetic algorithm (GA), particle swarm optimization (PSO), and the non-dominated sorting genetic algorithm (NSGA-II). …”
-
20
Modeling and Guidance of an Underactuated Autonomous Underwater Vehicle
Published 2017Get full text
doctoralThesis