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

“…The method formulates the allocation problem using the clique partitioning problem, an NP-complete problem, and handles multicycle functional units as well as structural pipelining. The algorithm has a running time complexity of O(1) for a circuit with n operations and c shared resources. …”
Get full text
Get full text
Get full text

A Comparative Study of Elgamal Based Cryptographic Algorithms by Haraty, Ramzi A.

“…In this work we implement the classical and modified ElGamal cryptosystem to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Baby-Step-Giant algorithm which works in the domain of natural integers. …”
Get full text
Get full text
Get full text

Cross entropy error function in neural networks by Nasr, G.E.

“…The ANN is implemented using the cross entropy error function in the training stage. The cross entropy function is proven to accelerate the backpropagation algorithm and to provide good overall network performance with relatively short stagnation periods. …”
Get full text
Get full text
Get full text

Evolution Of Activation Functions for Neural Architecture Search by Nader, Andrew

“…However, to the best of our knowledge, the design of new activation functions has mostly been done by hand. In this work, we propose the use of a self-adaptive evolutionary algorithm that searches for new activation functions using a genetic programming approach, and we compare the performance of the obtained activation functions to ReLU. …”
Get full text
Get full text
Get full text

From Collatz Conjecture to chaos and hash function by Masrat Rasool (17807813)

“…By incorporating the Collatz process and carefully considering key-controlled variables, the proposed model aims to offer enhanced security properties while meeting the necessary criteria for a reliable and effective hashing mechanism. The effectiveness and dependability of the proposed hash function are evaluated by comparing it with two well-known hash algorithms, namely SHA-3 and SHA-2, as well as several other Chaos-based hash algorithms. …”

New fault models and efficient BIST algorithms for dual-portmemories by Amin, A.A.

“…The testability problem of dual-port memories is investigated. A functional model is defined, and architectural modifications to enhance the testability of such chips are described. …”
Get full text
Get full text

Application of Red Deer Algorithm in Optimizing Complex functions by Zitar, Raed

“…The Red Deer algorithm (RDA), a recently developed population-based meta-heuristic algorithm, is examined in this paper with the optimization task of complex functions. …”
Get full text
Get full text

A genetic-based algorithm for fuzzy unit commitment model by Mantawy, A.H.

“…In the implementation for the GA, coding of the UCP solutions is based on mixing binary and decimal representations. A fitness function is constructed from the total operating cost of the generating units plus a penalty term determined due to the fuzzy load and spinning reserve membership functions. …”
Get full text
Get full text

Improving the Secure Socket Layer Protocol by modifying its Authentication function by El-Kassar, A. N.

“…SSL uses three interdependent cryptographic functions to perform a secure connection. The first function is authentication. …”
Get full text
Get full text
Get full text
Get full text

A comparative study of RSA based digital signature algorithms by Haraty, Ramzi A.

“…We implement the classical and modified RSA cryptosystem to compare and to test their functionality, reliability and security. To test the security of the algorithms we implement attack algorithms to solve the factorization problem in Z, Z[<i>i</i>] and F[<i>x</i>]. …”
Get full text
Get full text
Get full text
Get full text

Optimization of Support Structures for Offshore Wind Turbines using Genetic Algorithm with Domain-Trimming (GADT) by AlHamaydeh, Mohammad

“…The resulting adaptive, high-performance technique is called Genetic Algorithm with Domain-Trimming (GADT). As a proof of concept, the GADT is applied to a widely used benchmark problem. …”
Get full text

Tracking analysis of normalized adaptive algorithms by Moinuddin, M.

“…Close agreement between analytical analysis and simulation results is obtained for the case of the NLMS algorithm. The results show that, unlike the stationary case, the steady-state excess-mean-square error is not a monotonically increasing function of the step-size, while the ability of the adaptive algorithm to track the variations in the environment degrades by increasing the frequency offset.…”
Get full text
Get full text

Evolutionary algorithm for protein structure prediction by Mansour, Nashat

“…A protein is characterized by its 3D structure, which defines its biological function. …”
Get full text
Get full text
Get full text
Get full text

Evolutionary Algorithms for VLSIMultiobjective Netlist Partitioning by Sait, Sadiq M.

“…A series of experiments are performed to evaluate the efficiency of the algorithms. …”
Get full text

New enumeration algorithm for regular boolean functions by Nasrallah, Walid F.

“…This paper introduces a new algorithm for enumerating regular Boolean functions. …”
Get full text
Get full text
Get full text
Get full text

Sensitivity to parameters and general applicability of genetic algorithms and simulated annealing algorithms for mapping data to multicomputers. (c1994) by Kawash, Jalal Y.

Get full text
Get full text

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

“…The three heuristics are applied on the same optimization problem and compared with respect to (1) quality of the best solution identified by each heuristic, (2) progress of the search frominitial solution(s) until stopping criteria are met, (3) the progress of the cost of the best solution as a function of time (iteration count), and (4) the number of solutions found at successive intervals of the cost function. …”
Get full text

Convergence analysis of the variable weight mixed-norm LMS-LMFadaptive algorithm by Zerguine, A.

“…In this work, the convergence analysis of the variable weight mixed-norm LMS-LMF (least mean squares-least mean fourth) adaptive algorithm is derived. The proposed algorithm minimizes an objective function defined as a weighted sum of the LMS and LMF cost functions where the weighting factor is time varying and adapts itself so as to allow the algorithm to keep track of the variations in the environment. …”
Get full text
Get full text

A deterministic heuristic algorithm for optimal multiprocessor scheduling. (c1995) by Moujabber, Bassam N.

Get full text
Get full text

A parallel tabu search algorithm for VLSI standard-cell placement by Suit, S.M.

“…In this work, tabu search placement algorithm is parallelized on a network of workstations using PVM. …”
Get full text
Get full text