Belief selection in point-based planning algorithms for POMDPs by Azar, Danielle

“…Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value function can be derived by interpolation from the values of a specially selected set of points. …”
Get full text
Get full text
Get full text
Get full text

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

“…It is used to allow the client to identify the server and optionally allow the server to identify the client. The most common cryptographic algorithm used for this function is RSA. …”
Get full text
Get full text
Get full text
Get full text

Properties of simulated annealing and genetic algorithms for mapping data to multicomputers by Mansour, Nashat

“…We experimentally analyze some properties of simulated annealing algorithms (SA) and genetic algorithms (GA) for mapping data to multicomputers. …”
Get full text
Get full text
Get full text

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

“…These modifications allow multiple access of memory cells for increased test speed with minimal overhead on both silicon area and device performance. New fault models are proposed, and efficient O(n) test algorithms are described for both the memory array and the address decoders. …”
Get full text
Get full text

Mobile robots obstacles avoidance using dynamic window approach by Abubakr, Omer Ali

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. Most widely known algorithms of this category are genetic algorithms (GA). …”
Get full text

A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems by Bilal Khurshid (16715865)

“…<p dir="ltr">This study investigates the no-wait flow shop scheduling problem and proposes a hybrid (HES-IG) algorithm that utilizes makespan as the objective function. …”

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. …”

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

Get full text
Get full text

An enhanced binary Rat Swarm Optimizer based on local-best concepts of PSO and collaborative crossover operators for feature selection by Abu Zitar, Raed

“…The binary enhanced RSO is built based on three successive modifications: i) an S-shape transfer function is used to develop binary RSO algorithms; ii) the local search paradigm of particle swarm optimization is used with the iterative loop of RSO to boost its local exploitation; iii) three crossover mechanisms are used and controlled by a switch probability to improve the diversity. …”

Optimized FPGA Implementation of PWAM-Based Control of Three—Phase Nine—Level Quasi Impedance Source Inverter by Syed Rahman (569240)

Development of Lévy flight-based reptile search algorithm with local search ability for power systems engineering design problems by Abu Zitar, Raed

“…This paper is a further attempt to offer a better optimizing structure, therefore, aims to provide a better-performing algorithm both for designing an appropriate proportional-integral-derivative (PID) controller to effectively operate an automatic voltage regulator (AVR) system and extracting the optimum parameters of a power system stabilizer (PSS) employed in a single-machine infinite-bus (SMIB) power system. …”
Get full text

New Fast Arctangent Approximation Algorithm for Generic Real-Time Embedded Applications by Mohieddine Benammar (18103039)

“…The new algorithm exploits the pseudo-linear region around the tangent function zero point to estimate a reduced input arctangent through a modified rational approximation before referring this estimate to its original value using miniature LUTs. …”

Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines by Saleh, Ayat

Get full text

A non-convex economic load dispatch problem using chameleon swarm algorithm with roulette wheel and Levy flight methods by Abu Zitar, Raed

“…In this paper, several enhancements were made to this algorithm. First, it’s position updating process was slightly tweaked and took advantage of the chameleons’ randomization as well as adopting several time-varying functions. …”
Get full text

Adaptive Time-Varying Brain Source Localization by Al-Momani, Sajedah A.

Get full text

Selection of the learning gain matrix of an iterative learning control algorithm in presence of measurement noise by Saab, Samer S.

“…This work also provides a recursive algorithm that generates the appropriate learning gain functions that meet the arbitrary high precision output tracking objective. …”
Get full text
Get full text
Get full text
Get full text

Motion Artifacts Correction From EEG and fNIRS Signals Using Novel Multiresolution Analysis by Md. Shafayet Hossain (16888833)

On the performance of fusion based planet-scope and Sentinel-2 data for crop classification using inception inspired deep convolutional neural network by Nasru Minallah (9427338)

Optimized Load-Scheduling Algorithm for CubeSat's Electric Power System Management Considering Communication Link by Bayan Hussein (16904856)

“…An optimization problem is formulated with data rate and BER in the cost function while maintaining energy and power constraints. …”