بدائل البحث:
method algorithm » mould algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
data algorithm » jaya algorithm (توسيع البحث), deer algorithm (توسيع البحث)
element » elements (توسيع البحث)
method algorithm » mould algorithm (توسيع البحث)
using algorithm » cosine algorithm (توسيع البحث)
data algorithm » jaya algorithm (توسيع البحث), deer algorithm (توسيع البحث)
element » elements (توسيع البحث)
-
121
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
منشور في 2016احصل على النص الكامل
doctoralThesis -
122
Simulated annealing and genetic algorithms for exam scheduling. (c1997)
منشور في 1997احصل على النص الكامل
احصل على النص الكامل
masterThesis -
123
Genetic and heuristic algorithms for regrouping service sites. (c2000)
منشور في 2000احصل على النص الكامل
احصل على النص الكامل
masterThesis -
124
A fast exact sequential algorithm for the partial digest problem
منشور في 2016"…Two types of simulated data, random and Zhang, are used to measure the efficiency of the algorithm. …"
-
125
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
منشور في 2002"…The proposed algorithm has a time complexity of O(1) for a neural network with n vertices and c cliques. …"
احصل على النص الكامل
احصل على النص الكامل
article -
126
Fixed-parameter algorithms for hitting set problems. (c2006)
منشور في 2006احصل على النص الكامل
احصل على النص الكامل
masterThesis -
127
A forward-backward Kalman for the estimation of time-variant channels in OFDM
منشور في 2005"…In this paper, we propose an expectation-maximization (EM) algorithm for joint channel and data recovery. The algorithm makes use of the rich structure of the underlying communication problem-a structure induced by the data and channel constraints. …"
احصل على النص الكامل
احصل على النص الكامل
article -
128
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
منشور في 1992"…Graph contraction leads to remarkable reductions in mapping time, while maintaining good mapping qualities. It allows large-scale mapping to become efficient, especially when the physical optimization algorithms are used.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
129
New Efficient Frequency Domain Algorithm For H-Infinity Approximation
منشور في 2020"…The schemes are applicable in both continuous and discrete-time cases. The new algorithm is used to obtain reduced order controllers for a well known control problem.…"
احصل على النص الكامل
article -
130
Real-Time Smart-Digital Stethoscope System for Heart Diseases Monitoring
منشور في 2019"…Twenty-seven t-domain, f-domain, and Mel frequency cepstral coefficients (MFCC) features were used to train a public database to identify the best-performing algorithm for classifying abnormal and normal heart sound (HS). …"
-
131
FPGA-based Parallel Hardware Architecture for Real-time Object Classification
منشور في 2014احصل على النص الكامل
doctoralThesis -
132
-
133
A Survey of cuckoo search algorithm: optimizer and new applications
منشور في 2024"…The proposed search technique is compared with the existing standard optimization algorithms. The current CS computations are merged with Lévy flight and it was the first time used to solve nonlinear benchmark challenges.…"
احصل على النص الكامل
-
134
-
135
A Scatter search algorithm for exam scheduling. (c2006)
منشور في 2006احصل على النص الكامل
احصل على النص الكامل
masterThesis -
136
-
137
Performance Analysis of Artificial Neural Networks in Forecasting Financial Time Series
منشور في 2013احصل على النص الكامل
doctoralThesis -
138
Simulated evolution algorithm for multiobjective VLSI netlist bi-partitioning
منشور في 2003"…A series of experiments are performed to evaluate the efficiency of the algorithm. ISCAS-85/89 benchmark circuits are used and experimental results are reported and compared to earlier algorithms like GA and TS.…"
احصل على النص الكامل
احصل على النص الكامل
article -
139
Reinforcement R-learning model for time scheduling of on-demand fog placement
منشور في 2020"…We also demonstrate the ability of our model to improve over time by adapting the new demand of users. Experiments comparing the decisions of our model with two other potential fog placement approaches used for task/service scheduling (threshold based and random based) show that the number of processed requests performed by the cloud decreases from 100 to 30% with a limited number of fogs to push. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
140