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

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

“…In order to obtain a good spline model from large measurement data, we frequently have to deal with knots as variables, which becomes a continuous, non-linear and multivariate optimization problem with many local optima. …”
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

Bird’s Eye View feature selection for high-dimensional data by Samir Brahim Belhaouari (16855434)

“…However, high dimensional data often contains irrelevant features, outliers, and noise, which can negatively impact model performance and consume computational resources. …”

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

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

Subjects: “…Estimation error,Runtime,Computational modeling,Data structures,Approximation algorithms,Encoding,Computational efficiency…”
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

Design of acoustic absorbing metasurfaces using a data-driven approach by Hamza Baali (14603380)

Subjects:

Development of an Optimization Algorithm for Internet Data Traffic by Misbahuddin, Syed

“…In this paper, an optimization algorithm is proposed to reduce net data traffic, which works at Internet layer in the TCP/IP reference model. …”
Get full text

Data of simulation model for photovoltaic system's maximum power point tracking using sequential Monte Carlo algorithm by Odat, Alhaj-Saleh A.

“…This article outlines the input data and partial shading conditions employed in the replication model of Sequential Monte Carlo (SMC)-based tracking techniques for photovoltaic (PV) systems. …”
Get full text
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. …”

A Tabu Search algorithm for mapping data to multicomputers. (c1997) by Diab, Kamal M.

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

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

A Hybrid Deep Learning Model Using CNN and K-Mean Clustering for Energy Efficient Modelling in Mobile EdgeIoT by Dhananjay Bisen (19482454)

A Parallel Neural Networks Algorithm for the Clique Partitioning Problem by Harmanani, Haidar M.

“…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text