0

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a

In this paper, the memorization capability of a multilayer interpolative neural network is exploited to estimate a mobile position based on three angles of arrival. The neural network is trained with ideal angles-position patterns distributed uniformly throughout the region. This approach is compared with two other analytical methods, the average-position method which relies on finding the average position of the vertices of the uncertainty triangular region and the optimal position method which relies on finding the nearest ideal angles-position pattern to the measured angles. Simulation results based on estimations of the mobile position of particles moving along a nonlinear path show that the interpolative neural network approach outperf

Orthogonal Frequency Division Multiplexing (OFDM) is one of recent years multicarrier modulation used in order to combat the Inter Symbol Interference (ISI) introduced by frequency selective mobile radio channel. The circular extension of the data symbol, commonly referred to as cyclic prefix is one of the key elements in an OFDM transmission scheme. This paper study The influence of the cyclic prefix duration on the BER performance of an OFDM-VCPL (Orthogonal frequency division multiplexing - Variable Cyclic Prefix Length) system and the conventional OFDM system with frame 64-QAM modulation is evaluated by means of computer simulation in a multipath fading channel. The adaptation of CP is done with respect to the delay spread estimation

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord