بدائل البحث:
during algorithm » scheduling algorithm (توسيع البحث), cosine algorithm (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
complement » implement (توسيع البحث), complementary (توسيع البحث)
during algorithm » scheduling algorithm (توسيع البحث), cosine algorithm (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
complement » implement (توسيع البحث), complementary (توسيع البحث)
-
1
-
2
CNN and HEVC Video Coding Features for Static Video Summarization
منشور في 2022احصل على النص الكامل
article -
3
-
4
-
5
-
6
-
7
Automatic Video Summarization Using HEVC and CNN Features
منشور في 2022احصل على النص الكامل
doctoralThesis -
8
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. …"
احصل على النص الكامل
-
9
Brain Source Localization in the Presence of Leadfield Perturbations
منشور في 2015احصل على النص الكامل
doctoralThesis -
10
MAESTRO: Orchestrating Computational Offloading to Multiple FemtoClouds in Various Communication Environments
منشور في 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. …"
-
11
-
12
A novel technique for fast multiplication
منشور في 1995"…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
احصل على النص الكامل
article -
13
Face Recognition in Uncontrolled Indoor Environment
منشور في 2013احصل على النص الكامل
doctoralThesis -
14
The maximum common subgraph problem
منشور في 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.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
15
Localizing-ground Transmitters Using Airborne Antenna Array
منشور في 2020احصل على النص الكامل
doctoralThesis -
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
Utilization of AI to Predict Shear Strength Parameters of Soil Based on Their Physical Properties
منشور في 2025احصل على النص الكامل
doctoralThesis -
18
Maximal clique enumeration. (c2007)
منشور في 2007احصل على النص الكامل
احصل على النص الكامل
masterThesis -
19
The Frontiers of Deep Reinforcement Learning for Resource Management in Future Wireless HetNets: Techniques, Challenges, and Research Directions
منشور في 2022"…To this end, we carefully identify the types of DRL algorithms utilized in each related work, the elements of these algorithms, and the main findings of each related work. …"
-
20
Reliability of artificial intelligence in predicting total knee arthroplasty component sizes: a systematic review
منشور في 2023"…</p><h3>Conclusion</h3><p dir="ltr">This study demonstrated the potential of AI as a valuable complement for planning TKA, exhibiting a satisfactory level of reliability in predicting TKA implant sizes. …"