A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM حسب Al-Mohamad, HA

"…The complexity of the proposed algorithm is polynomial time, and it is O(n6 L) for matching graphs of size n. …"
احصل على النص الكامل

Decision trees حسب Srour, F. Jordan

الموضوعات: احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Graph Computing Systems and Partitioning Techniques: A Survey حسب Tewodros Alemu Ayall (19273717)

Methodology for Analyzing the Traditional Algorithms Performance of User Reviews Using Machine Learning Techniques حسب Abdul Karim (417009)

"…In this research, different machine-learning algorithms such as logistic regression, random forest and naïve Bayes were tuned and tested. …"

Machine Learning-Driven Prediction of Corrosion Inhibitor Efficiency: Emerging Algorithms, Challenges, and Future Outlooks حسب Najam Us Sahar Riyaz (22927843)

"…Drawing on more than fifteen harmonized datasets that span pyrimidines, ionic liquids, graphene oxides, and additional compound families, we benchmark traditional algorithms, such as artificial neural networks, support vector machines, k-nearest neighbors, random forests, against advanced graph-based and deep architectures including three-level directed message-passing neural networks, 2D3DMol-CIC, and graph convolutional networks. …"

Maximal clique enumeration. (c2007) حسب Barghout, Hamed

احصل على النص الكامل
احصل على النص الكامل

A linear programming approach for the weighted graph matchingproblem حسب Almohamad, H.A.

"…The complexity of the proposed algorithm is polynomial time, and it is O(n 6L) for matching graphs of size n. …"
احصل على النص الكامل
احصل على النص الكامل

A simulated evolution approach to task-matching and scheduling in heterogeneous computing environments حسب Barada, Hassan

"…Workloads are characterized according to the connectivity, heterogeneity, and communication-to-cost ratio of the task graphs representing the application tasks. The performance of SE is compared with a genetic algorithm approach for the same problem with respect to the quality of solutions generated, and timing requirements of the algorithms. r 2003 Elsevier Science Ltd. …"
احصل على النص الكامل

Optimum Partition of Power Networks Using Singular Value Decomposition and Affinity Propagation حسب Maymouna Ez Eddin (21633650)

Enhancing fairness and scalability in IOTA tangle networks: a POMDP-based tip selection algorithm for decentralized systems حسب Mays Alshaikhli (22564811)

FPGA-Based Network Traffic Classification Using Machine Learning حسب Elnawawy, Mohammed

احصل على النص الكامل

Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm حسب Nasser, Youssef

"…To achieve this goal, supervised machine learning was employed to train models on graphs with labeled data points, where each graph contains a set of points and a label indicating the centroid determined by K-means. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Wavelet Analysis- Singular Value Decomposition Based Method for Precise Fault Localization in Power Distribution Networks Using k-NN Classifier حسب Abhishek Raj (7245425)

Modular-width حسب Abu-Khzam, Faisal N.

احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Full-fledged semantic indexing and querying model designed for seamless integration in legacy RDBMS حسب Tekli, Joe

"…., considering the lexical and semantic similarities/disparities when matching user query and data index terms. To do so, we design and construct a semantic-aware inverted index structure called SemIndex, extending the standard inverted index by constructing a tightly coupled inverted index graph that combines two main resources: a semantic network and a standard inverted index on a collection of textual data. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Nonlinear Friction Identification of A Linear Voice Coil DC Motor حسب Takrouri, Mohannad Hashem

احصل على النص الكامل