An effective design system for dynamically reconfigurable architectures by Ouaiss, I.

“…Abstract: The SPARCS system is an integrated partitioning and synthesis environment for reconfigurable architectures. In this paper, we use the Joint Photographic Experts Group (JPEG) image compression algorithm as a design example to demonstrate the effectiveness of dynamic reconfiguration achieved using SPARCS. …”
Get full text
Get full text
Get full text
Get full text

Simulated evolution algorithm for multiobjective VLSI netlist bi-partitioning by Sait, Sadiq M.

“…A series of experiments are performed to evaluate the efficiency of the algorithm. ISCAS-85/89 benchmark circuits are used and experimental results are reported and compared to earlier algorithms like GA and TS.…”
Get full text
Get full text

Design and simulation of superdirective adaptive antenna arrays by Dawoud, M.M.

“…These characteristics were made possible by means of both amplitude and phase variations, based on predetermined optimized array polynomials. The commonly used adaptive algorithms were compared and the LMS (least mean square) algorithm was selected for the simulation of the adaptive array system. …”
Get full text
Get full text

A parallel GPU implementation of the timber wolf placement algorithm by Harmanani, Haidar M.

“…This paper describes the implementation of the Timber Wolf placement algorithm using CUDA and demonstrates the applicability of GPUs in accelerating electronic design automation tools. …”
Get full text
Get full text
Get full text
Get full text

Synthesis of MVL Functions - Part I: The Genetic Algorithm Approach by Sarif, Bambang

“…The algorithm is tested using 200 randomly generated 2-variable 4-valued functions. …”
Get full text
Get full text

Genetic Algorithm Based Simultaneous Eigenvalue Placement Of Power Systems by Abdel Magid, Y.L.

“…This paper demonstrates the use of genetic algorithms to design a single output feedback control law for the simultaneous eigenvalue placement of a power system running over a wide range of operating conditions. …”
Get full text

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

Design and Analysis of Secure Digital Twin Architecture by Shaikh, Eman

Get full text

Crashworthiness optimization of composite hexagonal ring system using random forest classification and artificial neural network by Monzure-Khoda Kazi (17191207)

“…Advanced machine learning algorithms are used in this study to figure out the complicated relationship between the crashworthiness parameters of the hexagonal composite ring specimens under lateral compressive, energy absorption, and failure modes. …”

Unsupervised Deep Learning for Classification Of Bats Calls Using Acoustic Data by Arshad, Muhammad Arbab

Get full text

A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems by Wali Khan Mashwani (14590504)

“…Thirty bound constrained benchmark functions are used to evaluate the performance of the proposed algorithm. …”

Fuzzified ant colony optimization algorithm for efficient combinational circuits synthesis by Sarif, B.A.B.

“…Multiobjective optimization of logic circuits based on a fuzzified ant colony (ACO) algorithm is presented. The results obtained using the proposed algorithm are compared to those obtained using SIS in terms of area, delay and power for some known circuits. …”
Get full text
Get full text

Design of adaptive arrays based on element position perturbations by Dawoud, M.M.

“…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …”
Get full text
Get full text

A parallel optimization algorithm for the maximum clique problem. (c2008) by Rizk, Mohamad A.

Get full text
Get full text

Efficient heuristic algorithms for influence propagation in social networks. (c2018) by Lamaa, Karine H.

“…Then we introduce the notion of an influence propagation function and use it to design an efficient algorithm across all types of networks. …”
Get full text
Get full text
Get full text

Evolutionary algorithms, simulated annealing and tabu search: a comparative study by Youssef, H.

“…The termevolutionary algorithmis used to refer to any probabilistic algorithmwhose design is inspired by evolutionary mechanisms found in biological species. …”
Get full text

An ant colony optimization algorithm to improve software quality prediction models by Azar, D.

“…Method This paper presents an adaptive approach that takes already built predictive models and adapts them (one at a time) to new data. We use an ant colony optimization algorithm in the adaptation process. …”
Get full text
Get full text
Get full text

A novel design technique for generating building form by KAYED, MAYS N. A.

“…The theoretical framework of the technique was successfully tested out and validated by implementing it over serious of examples that are categorized into three groups: examples directed to test out the proposed variables in each process, examples directed to validate the ability of whole technique to generate forms for a hypothetical project requirements and examples of scripting the mechanisms using the algorithmic editor interface and the visual programming language Grasshopper incorporated with Rhinoceros 3D software."…”
Get full text

Design and analysis of efficient and secure elliptic curve cryptoprocessors. by Al-Somani, Turki Faisal

“…Elliptic Curve Cryptosystems have attracted many researchers and have been included in many standards such as IEEE, ANSI, NIST, SEC and WTLS. The ability to use smaller keys and computationally more efficient algorithms compared with earlier public key cryptosystems such as RSA and ElGamal are two main reasons why elliptic curve cryptosystems are becoming more popular. …”
Get full text

A new tabu search algorithm for the long-term hydro scheduling problem by Mantawy, A.H.

“…The algorithm is based on using the short-term memory of the tabu search (TS) approach to solve the nonlinear optimization problem in continuous variables of the LTHSP. …”
Get full text
Get full text