Search Results - (( variable localization based algorithm ) OR ( java application path algorithm ))

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…In creating this application, NetBeans IDE 6.5and Java Micro Edition (Java ME) are used. …”
Get full text
Get full text

Visdom: Smart guide robot for visually impaired people by Lee, Zhen Ting

“…The system architecture integrates ROS 2 on a Raspberry Pi, with TCP/IP connectivity enabling remote operation. An Android mobile application, developed using Java and the java.net.Socket library, provides an intuitive and accessible user interface for seamless interaction with the robot. …”
Get full text
Get full text

Electricity demand forecasting in Turkey and Indonesia using linear and nonlinear models based on real-value genetic algorithm and extended Nelder-Mead local search by Wahab, Musa

Get full text
Get full text
Get full text

A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem by Sze, Jeeu Fong, Salhi, S., Wassan, N.

“…The AVNS consists of two stages: a learning phase and a multi-level VNS with guided local search. The adaptive aspect is integrated in the local search where a set of highly successful local searches is selected based on the intelligent selection mechanism. …”
Get full text
Get full text
Get full text

Fuzzy Adaptive Tuning of a Particle Swarm Optimization Algorithm for Variable-Strength Combinatorial Test Suite Generation by Kamal Z., Zamli, Ahmed, Bestoun S., Mahmoud, Thair, Afzal, Wasif

“…Research has shown that stochastic population-based algorithms such as particle swarm optimization (PSO) can be efficient compared to alternatives for VS-CIT problems. …”
Get full text
Get full text
Get full text

A decomposed streamflow non-gradientbased artificial intelligence forecasting algorithm with factoring in aleatoric and epistemic variables / Wei Yaxing by Wei , Yaxing

“…The firefly algorithm remains a feasible alternative for shallow architectural network models, while metaheuristic algorithms such as the Particle swarm algorithm and Bat algorithm are better options for deeper architectural network models. …”
Get full text
Get full text
Get full text

Potential norms detection in social agent societies by Mahmoud M.A., Mustapha A., Ahmad M.S., Ahmad A., Yusoff M.Z.M., Hamid N.H.A.

“…According to the literature, an agent changes or revises its norms based on variables of local environment and amount of thinking about its behaviour. …”

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

“…The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. …”
Get full text
Get full text
Get full text

Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

“…We choose an initial point and then perform a local search to find an initial local minimizer. …”
Get full text
Get full text
Get full text

Identification of continuous-time hammerstein model using improved archimedes optimization algorithm by Islam, Muhammad Shafiqul, Mohd Ashraf, Ahmad, Cho, Bo Wen

“…Although various optimization algorithms have been widely employed in multiple applications, the traditional Archimedes optimization algorithm (AOA) has presented imbalanced exploration with exploitation phases and the propensity for local optima entrapment. …”
Get full text
Get full text
Get full text
Get full text

Acoustic emission partial discharge localization in oil based on artificial bee colony by Lim, Zhi Yang, Azis, Norhafiz, Mohd Hashim, Ahmad Hafiz, Mohd Radzi, Mohd Amran, Norsahperi, Nor Mohd Haziq, Mohd Ariffin, Azrul

“…Comparisons with the genetic algorithm (GA), particle swarm optimization (PSO) and bat algorithm (BA) revealed that the distance error, maximum deviation and computation time for AE PD localization based on ABC are the lowest. …”
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

“…Greedy heuristics is a type of optimization algorithm that makes decisions based on locally optimal solutions. …”
Get full text
Get full text

Building norms-adaptable agents from Potential Norms Detection Technique (PNDT) by Mahmoud M.A., Ahmad M.S., Ahmad A., Mustapha A., Yusoff M.Z.M., Hamid N.H.A.

“…The literature proposes that an agent changes or updates its norms based on the variables of the local environment and the amount of thinking about its behaviour. …”

Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

“…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
Get full text
Get full text

Multi-Objective Multi-Exemplar Particle Swarm Optimization Algorithm with Local Awareness by Noori, Mustafa Sabah, Sahbudin, Ratna K.Z., Sali, Aduwati, Hashim, Fazirulhisyam

“…This capability is essential for solving complex problems across diverse scientific and engineering domains, where achieving optimal solutions often requires balancing multiple objectives. One of these MOO algorithms Multi-Objective Particle Swarm Optimization (MOPSO) extends it to handle problems with multiple objectives simultaneously, but like many swarm-based algorithms, MOPSO can suffer from premature convergence or local optima solutions. …”
Get full text
Get full text
Get full text

Analysis of robot localisation performance based on extended kalman filter by Che Hassan, Farah Hazwani

“…This project is implemented based on the existing localisation algorithm [30]. …”
Get full text
Get full text
Get full text
Get full text

Global Particle Swarm Optimization for High Dimension Numerical Functions Analysis by Jamian, J.J., Abdullah, M.N., Mokhlis, Hazlie, Mustafa, M.W., Bakar, Ab Halim Abu

“…This is done through sharing information of particle position between the dimensions (variables) at any iteration. The strategy can enhance the exploration capability of the GPSO algorithm to determine the optimum global solution and avoid traps at the local optimum. …”
Get full text
Get full text
Get full text

Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

“…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
Get full text
Get full text
Get full text

A new algorithm for normal and large-scale optimization problems: Nomadic People Optimizer by Alsewari, Abdul Rahman Ahmed, Sinan, Q. Salih

“…The algorithm is validated based on 36 unconstrained benchmark functions. …”
Get full text
Get full text
Get full text
Get full text

Optimizing lossless compression by normalized data length in Huffman Algorithm by Tonny, Hidayat

“…The proposed new algorithm has more optimal CR than the various variants of the Huffman-based lossless application. …”
Get full text
Get full text
Get full text