Search Results - (( problem solving method algorithm ) OR ( java location based algorithm ))

Group formation using genetic algorithm by Che Ani, Zhamri, Husin, Mohd Zabidin, Yasin, Azman

“…Due to the increasing of complexity in software projects, group work is becoming more important in order to ensure quality software products can be delivered on time.Thus, in universities, group work is seen as a good preparation for students to industry because by working in group, it can reduce the individual workload,improve the ability to manage a project and enhance the problem solving skills. However, due to lack of programming skills especially in Java programming language and the inability to have meetings frequently among the group members,most of the students’ software project cannot be delivered successfully.To solve this problem, systematic group formation is one of the initial factors that should be considered to ensure that every group consists of quality individuals who are good in Java programming and also to ensure that every group member in a group are staying closer to each other.In this research, we propose a method for group formation using Genetic Algorithms, where the members for each group will be generated based on the students’ programming skill and location of residential colleges.…”
Get full text
Get full text
Get full text
Get full text

Friendship Degree and Tenth Man Strategy: A new method for differentiating between erroneous readings and true events in wireless sensor networks by Adday, Ghaihab Hassan, Subramaniam, Shamala K., Zukarnain, Zuriati Ahmad, Samian, Normalia

“…The second stage will validate the voting process through a novel perspective based on the TMS. TMS will check the voters’ replies based on the event’s location. …”
Get full text
Get full text

Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

“…Genetic algorithm method was one of the methods that were widely used in solving optimization problem. …”
Get full text
Get full text

Iterative methods for solving split common fixed point problems in Hilbert spaces by Mohammed, Lawan Bulama

“…We also suggest some iterative methods for solving the split common fixed point problems for the class of total quasi asymptotically nonexpansive mappings and prove the convergence results of the proposed algorithms. …”
Get full text
Get full text
Get full text

Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

“…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
Get full text
Get full text

Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

“…The proposed method provides a platform to efficiently solve the MC problem by using approximation algorithm of Minimum Vertex Cover (MVC).…”
Get full text
Get full text
Get full text
Get full text

Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review by See, Phen Chiak, Wong, Kuan Yew

“…The main reason is that, QAPs provide possibilities to solve FLPs computationally. To date, there are two common approaches used to solve FLPs formulated as QAPs, that is, exact methods and approximate methods (also known as heuristics). …”
Get full text
Get full text

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

“…Due to the practical significance of this problem in real-world issues, numerous algorithms have been proposed to solve it. …”
Get full text
Get full text

Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

“…The algorithms proposed in this study should be considered in solving symmetric travelling salesman problems.…”
Get full text
Get full text
Get full text

A Method For Solving Mult-Objective Optimization Problem: Vector Evaluated Genetic Algorithm (Vega) by Tan, Tun Tai

“…Genetic Algorithms (GAs) are a powerful stochastic search in solving optimization problems. …”
Get full text
Get full text

Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

“…The shooting method is an effective numerical approach for solving boundary value problems (BVPs) by converting it into initial value problems (IVPs). …”
Get full text
Get full text

A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

“…The efficiency of the proposed method is identified while solving benchmark CVRPs. …”
Get full text
Get full text
Get full text
Get full text

Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

“…An adaptive bats sonar algorithm is proposed for solving single objective optimisation problems. …”
Get full text
Get full text

Solving economic load dispatch problem using genetic algorithm method / Norliza Kamarulzaman by Kamarulzaman, Norliza

“…In this study, Genetic Algorithm method is used to overcome this problem. …”
Get full text
Get full text

Artificial bee colony algorithm for solving optimal power flow problem by Le Dinh, L., Vo Ngoc, D., Vasant, P.

“…Therefore, the proposed ABC algorithm can be a favorable method for solving the OPF problem. …”
Get full text
Get full text

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

“…Existing method, known as FDTD needs a very long processing time to solve this problem. …”
Get full text
Get full text

Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems by Zulkifli, Munierah, Abd Rahmin, Nor Aliza, Wah, June Leong

“…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
Get full text
Get full text
Get full text

Comparison of Some Numerical Methods for Solving Real-Life Nonlinear Equations by Using Python Programming / Annie Gorgey ... [et al.] by Gorgey, Annie, Zulkifly, Zul Hafiezy, Hassim, Haslinah, Azim, Farah Adilla

“…The bisection method converges quickly compared with other methods for solving Planck’s radiation law, while Algorithm 1 converges quicker than other methods for solving the beam design problem. …”
Get full text
Get full text
Get full text

A Modified Bats Echolocation-Based Algorithm for Solving Constrained Optimisation Problems by N. M., Yahya, Tokhi, M. O.

“…The proposed algorithm is applied to solve the constrained optimisation problems coupled with penalty function method as constraint handling technique. …”
Get full text
Get full text
Get full text

The algorithms of Broyden-CG for unconstrained optimization problems by Mustafa, Mamat, Mohd Asrul Hery, Ibrahim, Leong Wah, June

“…The conjugate gradient method plays an important role in solving large-scaled problems and the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. …”
Get full text
Get full text