Secure Storage of Crypto Wallet Seed Phrase Using ECC and Splitting Technique حسب Syeda Tayyaba Bukhari (21842078)

Graph Contraction for Mapping Data on Parallel Computers حسب Mansour, N.

"…We then present experimental results on using contracted graphs as inputs to two physical optimization methods; namely, genetic algorithm and simulated annealing. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Incremental & classical genetic algorithm. (c2001) حسب Awad, Mohamad M.

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

Mapping realistic data sets on parallel computers حسب Mansour, N.

"…The GC algorithm allows large-scale mapping to become efficient, especially when slow but high-quality mappers are used.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Parallel genetic algorithm for disease-gene association حسب Mansour, Nashat

"…In this work, we combine few successful strategies from the literature and present a parallel genetic algorithm for the Tag SNP Selection problem. Our results compared favorably with those of a recognized tag SNP selection algorithm using three different data sets from the HapMap project.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Novel algorithms for accurate DNA base-calling حسب Mohammed, Omniyah Gul

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

Natural optimization algorithms for optimal regression testing حسب Mansour, Nashat

"…The experimental results show that they find optimal or near-optimal number of retests in a reasonable time.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Particle swarm optimization algorithm: review and applications حسب Abualigah, Laith

"…The main procedure of the PSO algorithm is presented. Future researchers can use the collected data in this survey as baseline information on the PSO and PSO's applications.…"
احصل على النص الكامل

New enumeration algorithm for regular boolean functions حسب Nasrallah, Walid F.

"…This algorithm exploits the equivalence between regular Boolean functions and positive threshold functions that can be used to represent instances of the knapsack problem. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Intelligent Fusion of Deep Features for Improved Waste Classification حسب Kashif Ahmad (12592762)

The Effects of Data Mining on Small Businesses in Dubai حسب AlMutawa, Rasha

"…While there are numerous studies on the best data mining models and their uses, even on certain industries, this study focuses on the applications more than the algorithms and models and their usefulness for small businesses specifically. …"
احصل على النص الكامل

Spider monkey optimizations: application review and results حسب Abualigah, Laith

"…Optimization algorithms are applied to find efficient solutions in different problems in several fields such as the routing in wireless networks, cloud computing, big data, image processing and scheduling, and so forth. …"
احصل على النص الكامل

A Hybrid Fault Detection and Diagnosis of Grid-Tied PV Systems: Enhanced Random Forest Classifier Using Data Reduction and Interval-Valued Representation حسب Khaled Dhibi (16891524)

"…The proposed approach deals with system uncertainties (current/voltage variability, noise, measurement errors, ⋯) by using an interval-valued data representation, and with large-scale systems by using a dataset size-reduction framework. …"

Optimization of Commercially Off the Shelf (COTS) Electric Propulsion System for Low Speed Fuel Cell UAV حسب Zulkifli, Muhammad

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

An Effective Hybrid NARX-LSTM Model for Point and Interval PV Power Forecasting حسب Mohamed Massaoudi (16888710)

"…First, the NARXNN model acquires the data to generate a residual error vector. Then, the stacked LSTM model, optimized by Tabu search algorithm, uses the residual error correction associated with the original data to produce a point and interval PVPF. …"

A direct algorithm for the parameterized face cover problem حسب Abu-Khzam, Faisal N.

"…It is known that, when k is fixed, finding a cover of size k (if indeed any exist) can be accomplished in polynomial time. …"
احصل على النص الكامل
احصل على النص الكامل

Intelligent Rapidly-Exploring Random Tree Star Algorithm حسب Ahmed, Khidir Galal Eldin Khidir

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

Intelligent Bilateral Client Selection in Federated Learning Using Game Theory حسب Wehbi, Osama

"…To overcome this problem, we present in this paper FedMint, an intelligent client selection approach for federated learning on IoT devices using game theory and bootstrapping mechanism. Our solution involves designing (1) preference functions for the client IoT devices and federated servers to allow them to rank each other according to several factors such as accuracy and price, (2) intelligent matching algorithms that take into account the preferences of both parties in their design, and (3) bootstrapping technique that capitalizes on the collaboration of multiple federated servers in order to assign initial accuracy value for the new connected IoT devices. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

An exact algorithm for connected red–blue dominating set حسب Abu-Khzam, Faisal N.

"…In this paper we present a first non-trivial exact algorithm whose running time is in O⁎(n1.3645). We use our algorithm to solve the Connected Dominating Set problem in O⁎(n1.8619). …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Convergence behavior of the normalized least mean fourth algorithm حسب Zerguine, A.

"…Unlike the LMF algorithm, the convergence behavior of the NLMF algorithm is independent of the input data correlation statistics. …"
احصل على النص الكامل
احصل على النص الكامل