Search Results - (( evolution optimization bat algorithm ) OR ( variable iteration method algorithm ))

Multi-Swarm bat algorithm by Taha A.M., Chen S.-D., Mustapha A.

“…In this study a new Bat Algorithm (BA) based on multi-swarm technique called the Multi-Swarm Bat Algorithm (MSBA) is proposed to address the problem of premature convergence phenomenon. …”

An efficient method for determining all the extreme points of function with one variable by Pandiya, Ridwan

Get full text

Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

“…The thesis was set to three objectives as follows; to develop a new augmentation algorithm of Simplex method from the existed augmentation studies; to integrate the superiorities of the QSM and BLSA algorithms that can enhance computational performance; to compare the performance of the new augmentation algorithm with the conventional Simplex, QSM and BLSA in reducing iteration number. …”
Get full text
Get full text
Get full text
Get full text

Quality of service and energy efficient aware (QEEA) scheduling algorithm for long term evolution (LTE) network / Nurulanis Mohd Yusoff by Mohd Yusoff, Nurulanis

“…Basically, the QEEA is based on the Time Domain (TD) and Frequency Domain (FD) scheduling where it is dependent on the QoS requirements to allocate resources. The proposed algorithm is compared against other scheduling algorithms, namely, the Channel and QoS Aware (CQA), Priority Set Scheduler (PSS), Proportional Fair (PF), Maximum Throughput (MT) and Blind Average Throughput (BAT). …”
Get full text
Get full text

Partial Newton methods for a system of equations by Goh, Bean San, Leong, Wah June, Siri, Zailan

“…This is because it uses only one or two variables instead of all the search variables in each iteration.…”
Get full text
Get full text
Get full text

Optimizing the placement of fire department in Kulim using greedy heuristic and simplex method / Muhammad Abu Syah Mohd Suzaly by Mohd Suzaly, Muhammad Abu Syah

“…The next method is simplex method. The simplex method is a conceptual model approach for analysing linear programming problems with any number of variables. …”
Get full text
Get full text

Comparative study of modified BFGS and new scale modified BFGS for solving unconstrained optimization / Shahirah Atikah Mohamad Husnin by Mohamad Husnin, Shahirah Atikah

“…Broyden-Fletcher-Goldfarb-Shanno (BFGS) is one of a well-known Quasi-Newton update formula. This method is generally considered as the most efficient method among other variable metric methods for solving unconstrained optimization problems. …”
Get full text
Get full text

Enhanced Flipping Technique to Reduce Variability in Image Steganography by Kamil S., Abdullah S.N.H.S., Hasan M.K., Bohani F.A.

Modifications of parameter regula falsi method p-RF for inclusion of zero of a function with one real variable by Abu Bakar, Norhaliza

Get full text
Get full text

Model selection approaches of water quality index data by Kamarudin, Nur Azulia, Ismail, Suzilah

“…Automatic model selection by using algorithm can avoid huge variability in model specification process compared to manual selection.With the employment of algorithm, the right model selected is then also used for forecasting purposes. …”
Get full text
Get full text
Get full text

Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak by Emily Sing Kiang, Siew

“…The model employs a two-level structure, where the first level uses standard soft constraints as the objective function to evaluate solution quality, while the second level dynamically adapts to faculty-specific preferences. A constructive algorithm was developed to generate an initial feasible solution, which was subsequently refined using two primary approaches to evaluate their efficiency: Iterative Threshold Pipe Variable Neighborhood Descent (IT-PVND), and a modified Whale Optimization Algorithm (WOA). …”
Get full text
Get full text
Get full text
Get full text

The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin by Shamsudin, Siti Nur Hafiza

“…Numerical result shows that algorithm 2 which is one of the proposed CG methods is more efficiency when compared to other algorithms.…”
Get full text
Get full text

Improved hybrid methods in solving single variable nonlinear algebraic equations / Nor Hanim Abd Rahman by Abd Rahman, Nor Hanim

Get full text
Get full text

Existence and uniqueness for the evolutionary impulse control problem using an asynchronous algorithms by Haiour M., Bencheikh Le Hocine M.E.A., Jan R., Himadan A., Boulaaras S.

“…Our approach unfolds through a four-step methodology, leveraging distinctive features of a discrete iterative technique. This methodology integrates semi-implicit techniques with respect to the variable t and employs spatial approximation via finite element methods. …”

Towards large scale unconstrained optimization by Abu Hassan, Malik

“…This method computes a Newton-type direction by truncating the conjugate Gradient method iterates (inner iterations) whenever a required accuracy is nobtained, thereby the superlinear convergence is guaranteed. …”
Get full text
Get full text
Get full text

Extended multiple models selection algorithms based on iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm by Nur Azulia, Kamarudin

“…Therefore, in this study SUREAutometrics is improvised using two MLE methods, which are iterative feasible generalized least squares (IFGLS) and expectation-maximization (EM) algorithm, named as SURE(IFGLS)-Autometrics and SURE(EM)-Autometrics algorithms. …”
Get full text
Get full text
Get full text
Get full text

New algorithm of two-point block method for solving boundary value problem with dirichlet and Neumann boundary conditions by Phang, Pei See, Abdul Majid, Zanariah, Ismail, Fudziah, Othman, Khairil Iskandar, Suleiman, Mohamed

Get full text
Get full text
Get full text

FPGA implementation of variable precision Euclid’s GCD algorithm by Al-Haija, Qasem Abu, Syed Ahmad Abdul Rahman, Sharifah Mumtazah, Alfarran, Islam

“…Methodology: In this paper, we implement a fast GCD coprocessor based on Euclid's method with variable precisions (32-bit to 1024-bit). …”
Get full text
Get full text
Get full text

Design of digital circuit structure based on evolutionary algorithm method by Chong, Kok Hen, Aris, Ishak, Bashi, Senan Mahmood, Koh, Johnny Siaw Paw

“…The proposed method is an iterative procedure that consists of a constant-size population of individuals, each one encoding a possible solution in a given problem space. …”
Get full text
Get full text
Get full text

Scaled Conjugate Gradient using strong Wolfe line search for portfolio selection / Nurfatihah Anizan by Anizan, Nurfatihah

“…These methods are tested using 20 test functions with different variables also with four initial points have been for each variable. …”
Get full text
Get full text