Search Results - (( java application stemming algorithm ) OR ( parameter distribution problem algorithm ))

Modified Parameters of Harmony Search Algorithm for Better Searching by Nur Farraliza, Mansor, Abas, Z.A, Shibghatullah, A.S., Rahman, A.F.N.A

“…The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems. …”
Get full text
Get full text

Prior selection for Gumbel distribution parameters using multiple-try metropolis algorithm for monthly maxima PM10 data by Mohd Amin, Nor Azrita, Adam, Mohd Bakri, Ibrahim, Noor Akma

“…The Multiple-try Metropolis (MTM) algorithm is the new alternatives in the field of Bayesian extremes for summarizing the posterior distribution. …”
Get full text
Get full text

Embedded parallel distributed artificial intelligent processors for adaptive beam forming in WCDMA system by Krishnan P.S., Kiong T.S., Koh J., Yap D.

“…In this paper, an embedded parallel and distributed genetic algorithm (EPDGA) with dynamic parameter setting on a multiprocessor system is proposed. …”

Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text

Tasks Distribution In Driver Scheduling Using Dynamic Set Of Bandwidth In Harmony Search Algorithm With 2-Opt by Shaffiei, Zatul Alwani

“…In the standard HS, the value of bandwidth (BW) parameter was static, while in this research, a dynamic set of bandwidth (BW2) value was formed based on constraints (problem domain). …”
Get full text
Get full text
Get full text

Confidence intervals (CI) for concentration parameter in von Mises distribution and analysis of missing values for circular data / Siti Fatimah binti Hassan by Hassan, Siti Fatimah

“…The second part of the study is on the confidence intervals (CI) for the concentration parameter in von Mises distribution. Several methods in constructing the CI for the concentration parameter are proposed including CI based on circular population, CI based on the asymptotic distribution of ˆ , CI based on the distribution of 휃 and 푅 and also CI based on bootstrap-t method. …”
Get full text
Get full text

A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

“…Input parameters, the number of fireflies, and the number of function evaluations were determined before the implementation of the firefly algorithm to solve formulated problems. …”
Get full text
Get full text

An enhanced segment particle swarm optimization algorithm for kinetic parameters estimation of the main metabolic model of Escherichia coli by Mohammed Adam, Kunna, Tuty Asmawaty, Abdul Kadir, Muhammad Akmal, Remli, Noorlin, Mohd Ali, Kohbalan, Moorthy, Noryanti, Muhammad

“…Hence, based on the aforementioned problems, the optimization algorithm methods played an important role in addressing these problems. …”
Get full text
Get full text
Get full text

Semiparametric inference procedure for the accelarated failure time model with interval-censored data by Karimi, Mostafa

“…A computationally simple two-step iterative algorithm, called estimationapproximation algorithm, is introduced for estimating the parameters of the model on the basis of the rank estimators. …”
Get full text
Get full text
Get full text

A new HMCR parameter of harmony search for better exploration by Mansor, N.F., Abas, Z.A, Rahman, A.F.N.A, Shibghatullah, A.S., Sidek, S.

“…As a meta-heuristic algorithm, Harmony Search (HS) algorithm is a population-based meta-heuristics approach that is superior in solving diversified large scale optimization problems. …”
Get full text
Get full text

A new HMCR parameter of harmony search for better exploration by Nur Farraliza, Mansor, Abas, Z.A, Rahman, A.F.N.A, Shibghatullah, A.S., Sidek, S

“…As a meta-heuristic algorithm, Harmony Search (HS) algorithm is a population-based meta-heuristics approach that is superior in solving diversified large scale optimization problems. …”
Get full text
Get full text

Single-solution Simulated Kalman Filter algorithm for global optimisation problems by Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.

“…In the proposed ssSKF algorithm, the initialisation parameters are not constants, but they are produced by random numbers taken from a normal distribution in the range of 0, 1, thus excluding them from tuning requirement. …”
Get full text
Get full text

Single-solution Simulated Kalman Filter algorithm for global optimisation problems by Abdul Aziz, N.H., Ibrahim, Z., Ab Aziz, N.A., Mohamad, M.S., Watada, J.

“…In the proposed ssSKF algorithm, the initialisation parameters are not constants, but they are produced by random numbers taken from a normal distribution in the range of 0, 1, thus excluding them from tuning requirement. …”
Get full text
Get full text

Peak pressure analysis of foot plantar distribution based on image processing algorithm by Sabry, Ali Hussein

“…The proposed image processing that based on the related parameters. Thus, the image information of the pressure sensor can solve the balancing problem for those who have a problem during standing and walking.…”
Get full text
Get full text
Get full text

Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

“…Finally, two novel hybrid optimization algorithms namely, FLP-QOJaya algorithm for single objective OPF problems and MFLP-QOMJaya algorithm for MOOPF problems are proposed. …”
Get full text
Get full text

The comparison of tardiness in scheduling techniques for task distribution using grid simulation tool by Stapa @ Mustapa, Muhamad Azhar

“…The complexity of scheduling problem increases with the size of the Grid. The goal of this project is to test on tardiness parameter in local search based algorithms. …”
Get full text
Get full text
Get full text

Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

“…Finally, propose a new method of obtaining optimal parameters dropping functions for Random Early Detection (RED) algorithm. …”
Get full text
Get full text

Statistical approach on grading: mixture modeling by Md. Desa, Zairul Nor Deana

“…A solution to this problem is using the Markov Chain Monte Carlo method namely Gibbs sampler algorithm. …”
Get full text
Get full text

GENETIC ALGORITHM WITH DEEP NEURAL NETWORK SURROGATE FOR THE OPTIMIZATION OF ELECTROMAGNETIC STRUCTURE by MOHAMMED SHARIFF, NUR ATIQAH

“…The behavior of Genetic Algorithm (GA) where it generates and evolves the parameters towards a high-quality solution gives an advantage in obtaining ideal combination of parameters to fit in with the simulation. …”
Get full text
Get full text

Formulating and solving stochastic truck and trailer routing problems using meta-heuristic algorithms / Seyedmehdi Mirmohammadsadeghi by Seyedmehdi, Mirmohammadsadeghi

“…For solving this problem, the aforesaid algorithms have been applied. …”
Get full text
Get full text
Get full text