BUC algorithm for iceberg cubes by Nasr, George E.

“…The Uniform distribution is used as a basis for comparison. Results show that when the cube is sparse there is a correlation between the data distribution and the running time of the algorithm. …”
Get full text
Get full text
Get full text

An enhanced quorum selection algorithm by Haraty, Ramzi A.

Get full text
Get full text
Get full text

An Improved Quorum Selection Algorithm by Haraty, Ramzi A.

Get full text
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

Comparative analysis of metaheuristic load balancing algorithms for efficient load balancing in cloud computing by Jincheng Zhou (1887307)

“…This paper provides a comparative analysis of various metaheuristic load balancing algorithms for cloud computing based on performance factors i.e., Makespan time, degree of imbalance, response time, data center processing time, flow time, and resource utilization. …”

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

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

Improved scatter search algorithm for predicting all-atoms protein structures using charmm22 energy model. (c2010) by Ghalayini, Iman Adnan

Get full text
Get full text

A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM by Selim, S.Z.

“…The global minimum solution of the problem is found using a simulated annealing-based algorithm. …”
Get full text

Scalable parallel algorithms for difficult combinatorial problems by Abu-Khzam, Faisal N.

“…These complementary tools and technologies are used to launch systematic attacks on combinatorial problems of significance. …”
Get full text
Get full text
Get full text

Stochastic Search Algorithms for Exam Scheduling by Mansour, Nashat

“…A good exam schedule should aim to minimize conflicts and the two unfairness factors based on user-assigned weights to these three factors and subject to some constraints such as classrooms’ number and capacities. In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. …”
Get full text
Get full text

Bee Colony Algorithm for Proctors Assignment. by Mansour, Nashat

Get full text
Get full text
Get full text

A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves by Harmanani, Haidar M.

“…This paper investigates the use of parallel genetic algorithms in order to solve the open-shop scheduling problem. …”
Get full text
Get full text
Get full text

An efficient and secure compression technique for data protection using burrows-wheeler transform algorithm by M Baritha Begum (17541483)

Efficient Approximate Conformance Checking Using Trie Data Structures by Awad, Ahmed

“…By encoding the proxy behavior using a trie data structure, we obtain a logarithmically reduced search space for alignment computation compared to a set-based representation. …”
Get full text
Get full text
Get full text

An Evolutionary Algorithm for the Allocation Problem in High-Level Synthesis by Harmanani, Haidar

“…This paper presents an evolutionary algorithm to solve the datapath allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text

Algorithmic Study of Online Multi-Facility Location Problems by Markarian, Christine

“…This is known as the Multi-Facility Location problem (MFL) and has been studied in the offline setting, in which the entire input sequence is given to the algorithm at once. …”
Get full text
Get full text
Get full text
Get full text

A method for data path synthesis using neural networks by Harmanani, H.

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

Improved prairie dog optimization algorithm by dwarf mongoose optimization algorithm for optimization problems by Abualigah, Laith

“…The proposed method is based on enhancing the search process of the Prairie Dog Optimization Algorithm (PDOA) by using the primary updating mechanism of the Dwarf Mongoose Optimization Algorithm (DMOA). …”
Get full text

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

Get full text
Get full text