[PDF][PDF] Comparing between different approaches to solve the 0/1 Knapsack problem
Knapsack problem is a surely understood class of optimization problems, which tries to
expand the profit of items in a knapsack without surpassing its capacity, Knapsack can be …
expand the profit of items in a knapsack without surpassing its capacity, Knapsack can be …
Digital image watermarking processor based on deep learning
Much research and development have been made to implement deep neural networks for
various purposes with hardware. We implement the deep learning algorithm with a …
various purposes with hardware. We implement the deep learning algorithm with a …
Enhanced authentication system performance based on keystroke dynamics using classification algorithms
Nowadays, most users access internet through mobile applications. The common way to
authenticate users through websites forms is using passwords; while they are efficient …
authenticate users through websites forms is using passwords; while they are efficient …
Elapsed time of IoT application protocol for ECG: a comparative study between CoAP and MQTT
Smart devices adopt different IoT application protocols to achieve interoperability across
various nodes of the IoT network. CoAP and MQTT are two application protocols among a …
various nodes of the IoT network. CoAP and MQTT are two application protocols among a …
[PDF][PDF] Travelling salesman problem solution based-on grey wolf algorithm over hypercube interconnection network
Abstract Travelling Salesman Problem (TSP) is one of the most popular NP-complete
problems for the researches in the field of computer science which focused on optimization …
problems for the researches in the field of computer science which focused on optimization …
Efficient MapReduce matrix multiplication with optimized mapper set
The efficiency of matrix multiplication is a popular research topic given that matrices
compromise large data in computer applications and other fields of study. The proposed …
compromise large data in computer applications and other fields of study. The proposed …
A meta-heuristic framework based on clustering and preprocessed datasets for solving the link prediction problem
This study presents a solution to a problem commonly known as link prediction problem.
Link prediction problem interests in predicting the possibility of appearing a connection …
Link prediction problem interests in predicting the possibility of appearing a connection …
[PDF][PDF] Handling Missing Values: Application to University Data Set
DJ Prajapati, JH Prajapati - … of emerging trends in engineering and …, 2011 - researchgate.net
Data warehouses usually have some missing values due to unavailable data that affect the
number and the quality of the generated rules. The missing values could affect the coverage …
number and the quality of the generated rules. The missing values could affect the coverage …
Watermarking: A review of software and hardware techniques
Watermarking is a well-known technique traditionally used in banknotes and other
documents to discourage counterfeiting. It usually consists of semi-transparent symbols …
documents to discourage counterfeiting. It usually consists of semi-transparent symbols …
[PDF][PDF] Analysis of ant colony optimization algorithm solutions for travelling salesman problem
Ant Colony Optimization is a metaheuristic algorithm used for solving complex combinatorial
optimization problems. With inspiring the algorithm implementation by the biological …
optimization problems. With inspiring the algorithm implementation by the biological …