بدائل البحث:
custom algorithm » control algorithm (توسيع البحث), auction algorithm (توسيع البحث), cosine algorithm (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
complement i » comovement _ (توسيع البحث)
i algorithm » _ algorithms (توسيع البحث), rd algorithm (توسيع البحث)
custom algorithm » control algorithm (توسيع البحث), auction algorithm (توسيع البحث), cosine algorithm (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
complement i » comovement _ (توسيع البحث)
i algorithm » _ algorithms (توسيع البحث), rd algorithm (توسيع البحث)
-
1
-
2
CNN and HEVC Video Coding Features for Static Video Summarization
منشور في 2022احصل على النص الكامل
article -
3
-
4
-
5
-
6
-
7
-
8
Automatic Video Summarization Using HEVC and CNN Features
منشور في 2022احصل على النص الكامل
doctoralThesis -
9
Improved Jaya Synergistic Swarm Optimization Algorithm to Optimize Task Scheduling Problems in Cloud Computing
منشور في 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. …"
احصل على النص الكامل
-
10
-
11
-
12
Maximal clique enumeration. (c2007)
منشور في 2007احصل على النص الكامل
احصل على النص الكامل
masterThesis -
13
A novel technique for fast multiplication
منشور في 2020"…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
article -
14
Face Recognition in Uncontrolled Indoor Environment
منشور في 2013احصل على النص الكامل
doctoralThesis -
15
A novel technique for fast multiplication
منشور في 1995"…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
احصل على النص الكامل
article -
16
A new approach and faster exact methods for the maximum common subgraph problem
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
17
-
18
The maximum common subgraph problem
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
19
Autonomous Demand-Side Management in the Future Smart Grid
منشور في 2016احصل على النص الكامل
doctoralThesis -
20
A Literature Review on System Dynamics Modeling for Sustainable Management of Water Supply and Demand
منشور في 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. …"