بدائل البحث:
experimental basis » experimental analysis (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
basis algorithm » cosine algorithm (توسيع البحث)
complement i » comovement _ (توسيع البحث)
i algorithm » _ algorithms (توسيع البحث), rd algorithm (توسيع البحث)
experimental basis » experimental analysis (توسيع البحث)
coding algorithm » cosine algorithm (توسيع البحث), colony algorithm (توسيع البحث), scheduling algorithm (توسيع البحث)
basis algorithm » cosine 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
Experimental Investigation and Comparative Evaluation of Standard Level Shifted Multi-Carrier Modulation Schemes With a Constraint GA Based SHE Techniques for a Seven-Level PUC Inv...
منشور في 2019"…Mathematical background developed on the theoretical basis is verified by numerical simulation software and also validated on the developed laboratory-scale prototype experimental setup.…"
-
7
-
8
Automatic Video Summarization Using HEVC and CNN Features
منشور في 2022احصل على النص الكامل
doctoralThesis -
9
Fuzzy genetic algorithm for floorplanning
منشور في 2020"…Genetic algorithms (GAs) have been found to be very effective in solving numerous optimization problems, especially those with many (possibly) conflicting and noisy objectives. …"
احصل على النص الكامل
article -
10
Topology design of switched enterprise networks using a fuzzy simulated evolution algorithm
منشور في 2020"…Several variants of the algorithm are proposed and compared together via simulation and experimental results are provided. r 2002 Elsevier Science Ltd. …"
احصل على النص الكامل
article -
11
Topology design of switched enterprise networks using a fuzzy simulated evolution algorithm
منشور في 2020"…Several variants of the algorithm are proposed and compared together via simulation and experimental results are provided. r 2002 Elsevier Science Ltd. …"
احصل على النص الكامل
article -
12
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. …"
احصل على النص الكامل
-
13
An Artificial Neural Network for Online Tuning of Genetic Algorithm Based PI Controller for Interior Permanent Magnet Synchronous Motor–Drive
منشور في 2006"…An artificial neural network (ANN) for online tuning of a genetic algorithm based PI controller for interior permanent magnet synchronous motor (IPMSM) drive is presented in this paper. …"
احصل على النص الكامل
article -
14
-
15
Maximal clique enumeration. (c2007)
منشور في 2007احصل على النص الكامل
احصل على النص الكامل
masterThesis -
16
A novel technique for fast multiplication
منشور في 2020"…The algorithm is modelled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
article -
17
Face Recognition in Uncontrolled Indoor Environment
منشور في 2013احصل على النص الكامل
doctoralThesis -
18
A novel technique for fast multiplication
منشور في 1995"…The algorithms is modeled in a hardware description language and its VLSI chip implemented. …"
احصل على النص الكامل
احصل على النص الكامل
article -
19
Development and Implementation of a Hybrid Intelligent Controller for Interior Permanent Magnet Synchronous Motor Drives
منشور في 2004"…At each operating condition a genetic algorithm is used to optimize the PI controller parameters in a closed-loop vector control scheme. …"
احصل على النص الكامل
article -
20
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