Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm by Abu Zitar, Raed

“…Optimization algorithms are one of the most popular methods for solving NP-hard problems. …”
Get full text

A Hash-Based Assessment and Recovery Algorithm for Distributed Healthcare Systems Using Blockchain Technology by Jaber, Mohammad

“…Numerous damage assessment and recovery algorithms have been proposed in the literature. In this work, we present a distributed algorithm that uses blockchain technology and hash tables to solve the information warfare problem in healthcare systems. …”
Get full text
Get full text
Get full text

Web Based Online Hybrid Teaching Method of Network Music Course by Abu Zitar, Raed

“…Based on Web data mining, an improved algorithm of hybrid hierarchical recommendation algorithm and genetic algorithm is used in the experiment, and compared with the other two algorithms in the experiment. …”
Get full text

Capturing outline of fonts using genetic algorithm and splines by Sarfraz, M.

“…We present a method to convert the original problem into a discrete combinatorial optimization problem and solve it by a genetic algorithm. We also incorporate a corner detection algorithm to detect significant points which are necessary to capture a pleasant looking spline fitting for shapes such as fonts. …”
Get full text
Get full text

Damage assessment & recovery from malicious transactions using data dependency for deffensive information warfare. (c2006) by Zeitunlian, Arda

Get full text
Get full text

A genetic algorithm for testable data path synthesis by Harmanani, H.

“…The approach is formulated as an allocation problem and solved using an efficient genetic algorithm that generates cost-effective testable designs. …”
Get full text
Get full text
Get full text
Get full text

A neural networks algorithm for data path synthesis by Harmanani, Haidar M.

“…This paper presents a deterministic parallel algorithm to solve the data path allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text

An algorithm for solving bond pricing problem by Dibeh, Ghassan

Get full text
Get full text
Get full text
Get full text

Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

“…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
Get full text
Get full text
Get full text
Get full text

Genetic and heuristic algorithms for regrouping service sites. (c2000) by Tabbara, Hiba

Get full text
Get full text

Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms by Abdelouahed Hamdi (14158899)

“…Therefore, in this study we examined this market based on the price index of the automotive group, then optimized a portfolio of automotive companies using two methods. In the first method, the CVaR measurement was modeled by means of DEA, then Particle Swarm Optimization (PSO) and the Imperial Competitive Algorithm (ICA) were used to solve the proposed model. …”

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

Get full text
Get full text

Topics in graph algorithms by Abu-Khzam, Faisal Nabih

Get full text
Get full text
Get full text

An evolutionary algorithm for solving the geometrically constrained site layout problem by Zouein, P.

“…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
Get full text

Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem by Al-Mulhem, M.

“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text

Modified clarke wright algorithms for solving the realistic vehicle routing problem by Shour, Amina

Get full text
Get full text
Get full text
Get full text

Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) by Yassine, Mohamad M.

Get full text
Get full text
Get full text

Cryptocurrency Exchange Market Prediction and Analysis Using Data Mining and Artificial Intelligence by Al Rayhi, Nasser

“…One of the best algorithms in terms of the result is the Long Short Term Memory (LSTM) since it is based on recurrent neural networks which uses loop as a method to learn from heuristics data. …”
Get full text

Allocation and re-allocation of data in a grid using an adaptive genetic algorithm by Mansour, N.

“…Allocation and re-allocation of data in a grid using an adaptive genetic algorithm. …”
Get full text
Get full text
Get full text

Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities by Zouein, P. P.

“…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
Get full text
Get full text
Get full text