Search alternatives:
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
per algorithm » deer algorithm (Expand Search), rd algorithm (Expand Search), search algorithm (Expand Search)
complement i » comovement _ (Expand Search)
i algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element per » elementi per (Expand Search)
coding algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search), scheduling algorithm (Expand Search)
per algorithm » deer algorithm (Expand Search), rd algorithm (Expand Search), search algorithm (Expand Search)
complement i » comovement _ (Expand Search)
i algorithm » _ algorithms (Expand Search), rd algorithm (Expand Search)
element per » elementi per (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
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 -
10
Optimization of Commercially Off the Shelf (COTS) Electric Propulsion System for Low Speed Fuel Cell UAV
Published 2013Get full text
doctoralThesis -
11
-
12
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 -
13
-
14
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 -
15
-
16
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 -
17
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 -
18
-
19
The maximum common subgraph problem
Published 2017“…We transform an essential part of the search process into the task of enumerating maximal independent sets in only a part of only one of the input graphs. 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. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
20
A Literature Review on System Dynamics Modeling for Sustainable Management of Water Supply and Demand
Published 2023“…Although the scenario analysis is supported by simulation models, they further require the optimization models to yield optimal key parameter values. One noticeable finding is that only 12% of the articles used quantitative models to complement SDM for the decision-making process. …”