Search Results - (( java implementation modified algorithm ) OR ( problem representative _ 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

Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

“…Routing AGVs was proved to be NP-Complete and scheduling of jobs was also proved to be NP hard problems. The running time of any deterministic algorithms solving these types of problems increases very rapidly with the size of the problem, which can be many years with any computational resources available presently. …”
Get full text
Get full text

An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

“…Shortest path is one of the optimization problems that are difficult to solve. There are many algorithms that used to solve this problem. …”
Get full text
Get full text
Get full text

A Preliminary Study On Firefly Algorithm Approach For Travelling Salesman Problem by Ismail, Mohd Muzafar, Che Hasan, Mohd Hanif, Mohamad @ Ab Rahman, Syahrul Hisham, Jaafar, Hazriq Izzuan

“…Each firefly in Firefly Algorithm represents a candidate solution of the Travelling Salesman Problem. …”
Get full text
Get full text

Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems by Yusof, Zulkifli Md., Ibrahim, Zuwairie, Adam, Asrul, Azmi, Kamil Zakwan Mohd, Ab. Rahman, Tasiransurini, Muhammad, Badaruddin, Ab. Aziz, Nor Azlina, Abd Aziz, Nor Hidayati, Mokhtar, Norrima, Shapiai, Mohd Ibrahim, Muhammad, Mohd Saberi

“…These three combinatorial SKF algorithms use binary encoding to represent the solution to a combinatorial optimization problem. …”
Get full text
Get full text

A Preliminary Study on Camera Auto Calibration Problem Using Bat Algorithm by Mohd Annuar, Khalil Azha, Selamat, Nur Asmiza, Jaafar, Hazriq Izzuan, Mohamad, Syahrul Hisham

“…Each bat in Bat Algorithm represents a candidate solution for the problem and each dimension in the search space of the Bat Algorithm represents a parameter of intrinsic parameters: skew, focal length, and magnification factor. …”
Get full text
Get full text

Propositional satisfiability algorithm to find minimal reducts for data mining by Bakar, A.A., Sulaiman, M.N., Othman, M., Selamat, M.H.

“…A branch and bound algorithm is presented to solve the proposed SAT problem. …”
Get full text
Get full text

Magnetic Optimization Algorithm Approach For Travelling Salesman Problem by Ismail, Mohd Muzafar, Zakaria, Muhammad Iqbal, Zainal Abidin, Amar Faiz, Mad Juliani, Juwita, Lit, Asrani, Mirjalili, Seyedali, Nordin, Nur Anis, Mohamed Saaid, Muhammad Faiz

“…In this implementation, each magnetic agent or particle in Magnetic Optimization Algorithm represents a candidate solution of the Travelling Salesman Problem. …”
Get full text
Get full text

Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems by Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Asrul, Adam, Kamil Zakwan, Mohd Azmi, Tasiransurini, Ab Rahman, Badaruddin, Muhammad, Nor Azlina, Ab. Aziz, Norrima, Mokhtar, Mohd Ibrahim, Shapiai, Mohd Saberi, Mohamad

“…The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. …”
Get full text
Get full text
Get full text
Get full text

Adaptive persistence layer for synchronous replication (PLSR) in heterogeneous system by Beg, Abul Hashem

“…The PLSR architecture model, workflow and algorithms are described. The PLSR has been developed using Java Programming language. …”
Get full text
Get full text

A study on the parameter selection of bat algorithm in in optimizing parameters in camera auto calibration problem by Mohd Said, Rahaini, A Aziz, Khairul Azha, Zainal Abidin, Amar Faiz, Mat Jizat, Jessnor Arif, Mohd Khairuddin, Ismail, Widiyanto, Sigit, Abdul Waduth, Mohamed Faisal

“…Each bat in the Bat Algorithm represents a potential solution to the issue, and each dimension in the Bat Algorithm's search space represents one of the basic parameters: skew, focal length, and magnification factor. …”
Get full text
Get full text
Get full text

A simulation software for DNA computing algorithms implementation by Muhammad, M.S., Masra, S.M.W., Kipli, K., Zamhari, N.

“…The capturing of gel electrophoresis image represents the output of a DNA computing algorithm. …”
Get full text
Get full text
Get full text

Conflict-free automated guided vehicles routing using multi-objective genetic algorithm by Umar, Ali Umar, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah, Tang, Sai Hong

“…The problem is represented using one sub-chromosome for dispatching represented with random keys and the remaining sub-chromosomes for routing represented with priority-based encoding. …”
Get full text
Get full text
Get full text

Curve Reconstruction By Metaheuristics Algorithms On Cubic Rational Bézier Function by Mohamed, Najihah

“…The optimisation technique consists of exact algorithm, and approximate algorithm. The approximate algorithm is a good technique to be highlighted since it is a feasible way to develop an easier, more convenient curve fitting method, that will save great computation, solve a large scale problem and produce a better quality end result. …”
Get full text
Get full text

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm by Abarghouei, Amir Atapour

“…TSP is a representative of a large class of problems known as the combinatorial optimization problems. …”
Get full text
Get full text

A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…Quantum computing algorithms are considered for several problems in graph theory. …”
Get full text
Get full text

A Preliminary Study on Solving Knight’s Tour Problem Using Binary Magnetic Optimization Algorithm by Ismail, Mohd Muzafar, Shair, Ezreen Farina, Mohd Nor, Arfah Syahida, Mohd Shaari Azyze, Nur Latif Azyze, Mohd Karis, Safirin, Jaafar, Hazriq Izzuan, Mohamad, Syahrul Hisham

“…This paper proposes a model using Binary Magnetic Optimization Algorithm to solve the problem. Each particle represents a possible solution of the problem. …”
Get full text
Get full text