Search Results - (( problem using new algorithm ) OR ( java application customization algorithm ))

Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

“…The new algorithms also boast faster contractions. Both new algorithms performed better than DISOPE. …”
Get full text
Get full text

A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

“…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

“…The new hybrid algorithm has been applied on different cases of Knapsack problem with different dimensions. 20 case studies have been evaluated by the new hybrid algorithm. …”
Get full text
Get full text
Get full text
Get full text

Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

“…The solutions to both parts are discussed in details in this thesis. These new parallel and sequential finite difference time domain (FDTD) algorithms yield from O(h2), ordinary O(h4) and weighted average O(h4) centered difference discretization using direct-domain and temporary-domain are used to solve problems mentioned above. …”
Get full text
Get full text

Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md Norwawi, Norita

“…The new algorithm can effectively be used to tackle large scale optimization problems.Computational tests show promises of the new algorithm.…”
Get full text
Get full text
Get full text

A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

“…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
Get full text
Get full text

New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…However, one part of the algorithm, called heuristic function, is not updated at any time throughout the process to reflect the new information discovered by the ants.This paper proposes an Enhanced Ant Colony System algorithm for solving the Travelling Salesman Problem.The enhanced algorithm is able to generate shorter tours within reasonable times by using accumulated values from pheromones and heuristics.The proposed enhanced ACS algorithm integrates a new heuristic function that can reflect the new information discovered by the ants. …”
Get full text
Get full text
Get full text

Comparison between Genetic Algorithm and Prey-Predator Algorithm. by Ong, Hong Choon

“…The use of metaheuristic algorithms to different problems becomes very common after the introduction of genetic algorithm in 1975. …”
Get full text

The improvement of Item-based collaborative filtering algorithm in recommendation system using similarity index by Yao, Ma

“…However, the collaborative filtering algorithm faces cold-start problem, where new items in the shopping list are not identified and recognized by the system. …”
Get full text
Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

“…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
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

“…Each dataset is set to 10 different problems and the result of the iteration number was as follows: first datasets; new augmentation algorithm = 2, QSM = 4, BLSA = 7, and Simplex = 13 and second datasets; new augmentation algorithm = 1, QSM = 3, BLSA = 4, and Simplex = 8.…”
Get full text
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
Get full text
Get full text
Get full text

A new half-sweep algebraic multigrid (HSAMG) algorithm for two-point boundary problems by Sulaiman, Jumat, Othman, Mohamed, Hasan, Mohammad Khatim

“…The primary goal of this paper is to propose a new half-sweep algebraic multigrid (HSAMG) algorithm using the finite difference approximation equation for solving two-point boundary problems. …”
Get full text
Get full text

Hybrid genetic algorithm for uncapacitated university examination timetabling problem by Ishak, Suhada

“…All proposed algorithms are coded in C using Microsoft Visual C++ 6.0 as the compiler. …”
Get full text
Get full text

New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

“…Generally, the average results indicates that the newly developed algorithm retrieved better than original MABSA in finding a minimum point which increment 5.833% better than original MABSA, and new algorithm retrieved 5.204% more better than global optimum value. …”
Get full text
Get full text

Leader election algorithm in 2D torus networks with the presence of one link failure by Refai, M., Sharieh, A., Alshammari, F.

“…In a network of N nodes connected by two dimensional torus network, the new algorithm uses O(N) messages to elect a new leader in O(root v) lime steps. …”
Get full text

Enhancing three variants of harmony search algorithm for continuous optimization problems by Alomoush, Alaa A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alrosan, Ayat, Alomoush, Waleed, Alissa, Khalid

“…A convergence rate graph is also used to show the overall performance of the new algorithms.…”
Get full text
Get full text
Get full text

A modified partially mapped multiCrossover genetic algorithm for Two-Dimensional Bin Packing Problem by Sarabian, Maryam, Lee, Lai Soon

“…Results: Extensive computational experiments of the new proposed algorithm, MXGA, Standard GA (SGA), Unified Tabu Search (UTS) and Randomized Descent Method (RDM) were performed using benchmark data sets. …”
Get full text
Get full text

Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system by Jasni, Jasronita

“…Furthermore, the real data with 293 buses and 595 lines is used as a practical system for verification of the new algorithms The results show that these new algorithms are able to eliminate the convergence problem faced by the existing CPF algorithm. …”
Get full text
Get full text

Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

“…These binary variables are used to locally search for optimum solution. SDAA is developed using the concept of male ants performing nuptial flights to generate new superior colonies. …”
Get full text
Get full text
Get full text