-
201
Using Text Mining and Clustering Techniques on Tweets to Discover Trending Topics in Dubai
منشور في 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. …"
احصل على النص الكامل
-
202
Optimal Routing Protocol in Multimedia Wireless Sensor Networks
منشور في 2011احصل على النص الكامل
doctoralThesis -
203
Heuristics for graph decomposition
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
204
Definition and selection of fuzzy sets in genetic‐fuzzy systems using the concept of fuzzimetric arcs
منشور في 2008"…Design/methodology/approach – The design was based on two principles: selection and optimization. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
205
A collaborative filtering recommendation framework utilizing social networks
منشور في 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. …"
-
206
Genetic Fuzzimetric Technique (GFT)
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
207
DSDM: A Distributed Service Discovery Model for Manets
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
208
-
209
Autonomous Vehicles Delivery Systems: Analyzing Vehicle Routing Problems with a Moving Depot
منشور في 2019احصل على النص الكامل
doctoralThesis -
210
A matheuristic approach for solving the 2-connected dominating set problem
منشور في 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). …"
-
211
-
212
SDODV. (c2018)
منشور في 2018"…Therefore, the routing problem designated to find and maintain an optimal route between two nodes is not very straight forward. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
213
Dynamic Layout Planning Using a Hybrid Incremental Solution Method
منشور في 1999"…Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
214
On the disk dimension of planar graphs
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
215
-
216
A Robust Approach for Enhanced Autonomous Robot Navigation
منشور في 2024احصل على النص الكامل
doctoralThesis -
217
Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying
منشور في 2023"…Many efforts have been deployed by the IR community to extend freetext query processing toward semi-structured XML search. Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
218
MoveSchedule
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
219
Defining quantitative rules for identifying influential researchers: Insights from mathematics domain
منشور في 2024"…The rules were developed for each parameter category using the Decision Tree Algorithm, which achieved an average accuracy of 70 to 75 percent for identifying awardees in mathematics domains. …"
-
220
Application of Metastructures for Targeted Low-Frequency Vibration Suppression in Plates
منشور في 2022"…<h2>Purpose</h2> <p>We present an approach that combines finite element analysis and genetic algorithms to find the optimal configuration of local resonators created in the host structure to suppress their vibration in a target low-frequency range. …"