Search alternatives:
code algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search)
rd algorithm » _ algorithms (Expand Search)
element » elements (Expand Search)
finding » findings (Expand Search)
code algorithm » cosine algorithm (Expand Search), colony algorithm (Expand Search)
rd algorithm » _ algorithms (Expand Search)
element » elements (Expand Search)
finding » findings (Expand Search)
-
181
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
-
182
Optimal Routing Protocol in Multimedia Wireless Sensor Networks
Published 2011Get full text
doctoralThesis -
183
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 -
184
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 -
185
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. …”
-
186
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 -
187
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 -
188
-
189
Autonomous Vehicles Delivery Systems: Analyzing Vehicle Routing Problems with a Moving Depot
Published 2019Get full text
doctoralThesis -
190
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). …”
-
191
Predicting Compression Modes and Split Decisions for HEVC Video Coding Using Machine Learning Techniques
Published 2017Get full text
doctoralThesis -
192
The Frontiers of Deep Reinforcement Learning for Resource Management in Future Wireless HetNets: Techniques, Challenges, and Research Directions
Published 2022“…Then, we provide a comprehensive review of the most widely used DRL algorithms to address RRAM problems, including the value- and policy-based algorithms. …”
-
193
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 -
194
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 -
195
Design of A Theoretical Framework For A Real-Time Fire Evacuation Guidance System
Published 2020Get full text
doctoralThesis -
196
On the disk dimension of planar graphs
Published 2011“…More significantly, we devise a direct and highly practical linear-time algorithm to decide whether an arbitrary graph has fixed disk dimension k or less. …”
Get full text
Get full text
Get full text
conferenceObject -
197
-
198
-
199
A Robust Approach for Enhanced Autonomous Robot Navigation
Published 2024Get full text
doctoralThesis -
200
MoveSchedule
Published 1995“…The layout construction algorithm that underlies MoveSchedule uses Constraint Satisfaction to find the set of all positions that meet the constraints on resources' positions and Linear Programming to find the optimal positions that minimize resource transportation and relocation costs. …”
Get full text
Get full text
Get full text
masterThesis