Search Results - (( java implementation modified algorithm ) OR ( solving process using algorithm ))

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”

Prevention And Detection Mechanism For Security In Passive Rfid System by Khor, Jing Huey

“…The proposed protocol is designed with lightweight cryptographic algorithm, including XOR, Hamming distance, rotation and a modified linear congruential generator (MLCG). …”
Get full text
Get full text

Automatic generation of content security policy to mitigate cross site scripting by Mhana, Samer Attallah, Din, Jamilah, Atan, Rodziah

“…It can be extended to support generating CSP for contents that are modified by JavaScript after loading. Current approach inspects the static contents of URLs.…”
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
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

“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text

Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman by Abdul Rahman, Faridah

“…Sudoku Generator is a prototype that automatically generates and solves the Sudoku. Before this, Sudoku generator has been develop using backtracking algorithm only, but this research use two algorithm which is recursive and backtracking algorithm that called as hybrid algorithm. …”
Get full text
Get full text

Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources by Abed, Munther Hameed, Mohd Nizam Mohmad, Kahar

“…Additionally, an appropriate selection of GA operators was also experimented. The guide genetic algorithm (GGA) is not used to solve the unspecified dynamic UPMR. …”
Get full text
Get full text
Get full text

Optimization of mycelium growth using genetic algorithm for multi-objective functions by Muhamad Faiz, Abu Bakar

“…Trade-off between the objectives, exist for the optimization process. To solve this issues, multi-objective genetic algorithm was chosen as the methodology for this project, specifically using NSGA-ii algorithm. …”
Get full text
Get full text
Get full text

Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

“…This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing.…”
Get full text
Get full text
Get full text
Get full text

An Experimental Study of the Application of Gravitational Search Algorithm in Solving Route Optimization Problem for Holes Drilling Process by Omar, Norhaizat, Eng, Chieh Ong, Adam, Asrul, Hasim, Saipol Hadi, Zainal Abidin, Amar Faiz, Jaafar, Hazriq Izzuan, Zakaria, Hamzah, Hassan, Jefery, Nordin, Nur Anis, Osman, Khairuddin, Mohd Hussein, Shamsul Faisal

“…In this study, an optimization algorithm based on Gravitational Search Algorithm is proposed for solving route optimization in holes drilling process. …”
Get full text
Get full text

An improved sine cosine algorithm for solving optimization problems by Mohd Helmi, Suid, Mohd Riduwan, Ghazali, Mohd Ashraf, Ahmad, Addie Irawan, Hashim, Raja Mohd Taufika, Raja Ismail, Mohd Zaidi, Mohd Tumari

“…Due to its simplicity and less tedious parameter tuning over other multi-agent-based optimization algorithms, Sine Cosine Algorithm (SCA) has gained lots of attention from numerous researchers for solving optimization problem. …”
Get full text
Get full text
Get full text
Get full text

Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…Therefore, for solving the SMA algorithm local optima problem, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure. …”
Get full text
Get full text
Get full text

Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

“…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text

Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…Therefore, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure to solve the TSA algorithm local optima problem. …”
Get full text
Get full text
Get full text

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

“…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

Sequential algorithm of parabolic equation in solving thermal control process on printed circuit board by Alias, Norma, A. Ghaffar, Zarith Safiza, Ismail, Fatimah Sham, Mohamed Murid, Ali Hassan, Hassan, Hazrina

Get full text
Get full text

Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

“…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text

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

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

“…This approach was applied successfully to solve four hard combinatorial problems. Using this encoding scheme would enable researchers to solve other hard problems whilst also improving the algorithm.…”
Get full text
Get full text