Search alternatives:
method algorithm » mould algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
finding » findings (Expand Search)
method algorithm » mould algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
finding » findings (Expand Search)
-
181
Performance comparison of variable-stepsize IMEX SBDF methods on advection-diffusion-reaction models
Published 2025“…We develop an adaptive time-stepping and error control algorithm for VSSBDF methods up to fourth order based on a step-doubling refinement technique using estimates of the local truncation errors. …”
-
182
Performance comparison of variable-stepsize IMEX SBDF methods on advection-diffusion-reaction models
Published 2025“…We develop an adaptive time-stepping and error control algorithm for VSSBDF methods up to fourth order based on a step-doubling refinement technique using estimates of the local truncation errors. …”
-
183
Innovative mobile E-healthcare systems
Published 2016“…In this work, we propose a new cache replacement algorithm—Profit SACCS—that is based on the rule-based least profit value. …”
Get full text
Get full text
Get full text
Get full text
article -
184
Soft Sensor for NOx Emission using Dynamical Neural Network
Published 2020“…Lag space for the model is found by using genetic algorithm to find the best time delayed model. Lag space obtained from the linear model is then used for constriction of the dynamical neural network. …”
Get full text
article -
185
Information warfare recovery-fighting back through the matrix. (c2012)
Published 2012Get full text
Get full text
masterThesis -
186
Computational evluation of protein energy functions
Published 2014“…Also, we propose an approach based on a simulated annealing algorithm to find a better combination of energy terms, by assigning different weights to the terms, for the purpose of improving the capability of the computational prediction methods.…”
Get full text
Get full text
Get full text
conferenceObject -
187
Using Text Mining and Clustering Techniques on Tweets to Discover Trending Topics in Dubai
Published 2015“…Tweets corpus of Dubai were collected, they were presented through the bag of words model using TF-IDF weighting scheme, after that the output of text transformation was introduced to k-means clustering algorithm with cosine similarity measure. Findings indicate that heuristic evaluation techniques are not so helpful in this domain; also, the model has generated interesting clusters about trending topics and events in Dubai. …”
Get full text
-
188
Optimal Routing Protocol in Multimedia Wireless Sensor Networks
Published 2011Get full text
doctoralThesis -
189
Heuristics for graph decomposition
Published 2000“…The heuristic procedure that we propose is based on a hybrid genetic algorithm (HGA) for decomposing a graph followed by an iterative improvement heuristic for tuning the HGA's results. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
190
Definition and selection of fuzzy sets in genetic‐fuzzy systems using the concept of fuzzimetric arcs
Published 2008“…Design/methodology/approach – The design was based on two principles: selection and optimization. …”
Get full text
Get full text
Get full text
Get full text
article -
191
A collaborative filtering recommendation framework utilizing social networks
Published 2023“…The current study proposes a collaborative filtering recommendation framework that employs social networks to generate more precise and pertinent recommendations. The framework is based on a modified version of the user-based collaborative filtering algorithm, which computes user similarity based on their ratings and social connections. …”
-
192
Genetic Fuzzimetric Technique (GFT)
Published 2012“…This new proposed technique is termed as Genetic Fuzzimetric Technique (GFT) where the strength of this technique is based on the systematic approach of defining fuzzy sets (variables), cross-over and mutation of these variables in order to find the optimized performance. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
193
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 -
194
DSDM: A Distributed Service Discovery Model for Manets
Published 2008“…The designed system is based on storing service descriptions in selected nodes that are searched in accordance to a proposed Minimum Distance Packet Forwarding (MDPF) algorithm. …”
Get full text
Get full text
Get full text
Get full text
article -
195
-
196
Autonomous Vehicles Delivery Systems: Analyzing Vehicle Routing Problems with a Moving Depot
Published 2019Get full text
doctoralThesis -
197
A matheuristic approach for solving the 2-connected dominating set problem
Published 2019“…The goal of the proposed method is to find near optimal solutions for large graphs. The algorithm is based on a Greedy Randomized Adaptive Search Procedure (GRASP). …”
-
198
Predicting Compression Modes and Split Decisions for HEVC Video Coding Using Machine Learning Techniques
Published 2017Get full text
doctoralThesis -
199
SDODV. (c2018)
Published 2018“…Therefore, the routing problem designated to find and maintain an optimal route between two nodes is not very straight forward. …”
Get full text
Get full text
Get full text
masterThesis -
200
Dynamic Layout Planning Using a Hybrid Incremental Solution Method
Published 1999“…Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. …”
Get full text
Get full text
Get full text
article