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

Topics in graph algorithms by Abu-Khzam, Faisal Nabih

“…This is achieved by implementing some algorithms for the vertex cover problem, and conducting experiments on real data sets. …”
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

A combined algorithm based on finite elements and a modified methodof characteristics for the analysis of the corona in wire-ductelectrostatic precipitators by Al-Hamouz, Z.M.

Get full text
Get full text

Mapping realistic data sets on parallel computers by Mansour, N.

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

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

Adaptive Secure Pipeline for Attacks Detection in Networks with set of Distribution Hosts by ALSHAMSI, SUROUR

“…In order to benefit from multiple different classifiers, and exploit their strengths, the use of ensembling algorithms arises, which combine the results of the individual classifiers into a final result to achieve greater precision and thus a better result. …”
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

A reduced model for phase-change problems with radiation using simplified PN approximations by Belhamadia, Youssef

“…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
Get full text

Variable Selection in Data Analysis: A Synthetic Data Toolkit by Mitra, Rohan

“…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …”
Get full text

Automatic keyword extraction from a real estate classifieds data set by Devassy, Dibin

“…Keywords are considered to be a solution to this problem and are now widely used to search the information over the internet.In this project we analyze a real estate classifieds data set, with an objective to find keywords that represent this data set. …”
Get full text

Data reductions and combinatorial bounds for improved approximation algorithms by Abu-Khzam, Faisal N.

“…Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of data reduction rules and combinatorial insights. …”
Get full text
Get full text
Get full text
Get full text

Allocating data to distributed-memory multiprocessors by genetic algorithms by Mansour, Nashat

“…We present three genetic algorithms (GAs) for allocating irregular data sets to multiprocessors. …”
Get full text
Get full text
Get full text

Matheuristic Fixed Set Search Applied to the Two-Stage Capacitated Facility Location Problem by Denis Alicic (23073484)

On the Optimization of Band Gaps in Periodic Waveguides by Jamil Renno (14070771)

Subjects:

Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm by Nasser, Youssef

“…Among these, K-means is widely used for efficiently solving clustering problems. …”
Get full text
Get full text
Get full text

Physical optimization algorithms for mapping data to distributed-memory multiprocessors by Mansour, Nashat

“…We also present a technique for efficient mapping of large data sets. The algorithms include a parallel genetic algorithm (PGA), a parallel neural network algorithm (PNN) and a parallel simulated annealing algorithm (PSA). …”
Get full text
Get full text
Get full text