A Hybrid Intrusion Detection Model Using EGA-PSO and Improved Random Forest Method حسب Amit Kumar Balyan (18288964)

"…Due to a limited training dataset, an ML-based IDS generates a higher false detection ratio and encounters data imbalance issues. To deal with the data-imbalance issue, this research develops an efficient hybrid network-based IDS model (HNIDS), which is utilized using the enhanced genetic algorithm and particle swarm optimization(EGA-PSO) and improved random forest (IRF) methods. …"

Cyberbullying Detection Model for Arabic Text Using Deep Learning حسب Albayari, Reem

"…As a result of the models’ evaluation, a hybrid DL model is proposed that combines the best characteristics of the baseline models CNN, BLSTM and GRU for identifying cyberbullying. …"
احصل على النص الكامل
احصل على النص الكامل

Neural Networks as a Convex Problem حسب Khalil, Baha

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

Fault-Tolerant Network Topologies for Datacenters حسب Attia, Heba Mahmoud Helal

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

Transformations for Variants of the Travelling Salesman Problem and Applications حسب Assaf, Mustafa Jamil

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

A Comparative study between cache replacement algorithms used in the scalable asynchronous cache consistency scheme. (c2006) حسب Turk, Lana

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

Complexities of special matrix multiplication problems حسب Takche, J.

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

Parallel implementation of clique partitioning using artificial neural networks. (c2000) حسب Hajj, Hisham

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

Haplotype inference by pure-parsimony using revamped delayed haplotype selection. (c2011) حسب Abdallah, Raymond

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

The multi-parameterized cluster editing problem حسب Abu-Khzam, Faisal N.

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

Incremental Genetic Algorithm حسب Mansour, Nashat

"…If these problems are not small in size, it becomes costly to use a genetic algorithm to reoptimize them after each modification. …"
احصل على النص الكامل
احصل على النص الكامل

Topics in graph algorithms حسب Abu-Khzam, Faisal Nabih

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

Augmented arithmetic optimization algorithm using opposite-based learning and lévy flight distribution for global optimization and data clustering حسب Abu Zitar, Raed

"…This paper proposes a new data clustering method using the advantages of metaheuristic (MH) optimization algorithms. …"

Minimizing using BBO and DFO methods حسب El Zeghondy, Jean

"…In [1], Nour and Zeidan proposed a numerical algorithm to solve optimal control problems involving sweeping processes. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Information reconciliation through agent controlled graph model. (c2018) حسب Saba, Rita

"…Multiple models have been proposed and different techniques and data structures were used. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Arabic Text Classification Using Modified Artificial Bee Colony Algorithm for Sentiment Analysis: The Case of Jordanian Dialect حسب Habeeb, Abdallah

"…The second phase, modified the Artificial Bee Colony (ABC) Algorithm, with Upper Confidence Bound (UCB) Algorithm, to promote the exploitation ability for the minimum dimension, to get the minimum number of the optimal feature, then using forward feature selection strategy by four classifiers of machine learning algorithms: (K-Nearest Neighbors (KNN), Support vector machines (SVM), Naïve-Bayes (NB), and Polynomial Neural Networks (PNN). …"
احصل على النص الكامل

On-site workshop investment problem: A novel mathematical approach and solution procedure حسب Nima Moradi (19418821)

Interval-Valued SVM Based ABO for Fault Detection and Diagnosis of Wind Energy Conversion Systems حسب Majdi Mansouri (16869885)

الموضوعات:

Effective solutions for the capacitated vehicle routing problem and for the split delivery vehicle routing problem with time windows. (c2013) حسب Hilal, Nathalie

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

On the parameterized parallel complexity and the vertex cover problem حسب Abu-Khzam, Faisal N.

"…We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n) , where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل