Search Results - (( java implementation path algorithm ) OR ( grid computing machine algorithm ))

Adaptive intelligence job online scheduling within dynamic grid environment based on gridsim by Lorpunmanee, Siriluck, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan

Get full text
Get full text

Job online scheduling within dynamic grid environment by Lorpunmanee, Siriluck, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan

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

“…Today scheduling in Grid computing involves much static and fix algorithm. …”
Get full text
Get full text
Get full text

Optimization of support vector machine parameters in modeling of Iju deposit mineralization and alteration zones using particle swarm optimization algorithm and grid search method by Abbaszadeh M., Soltani-Mohammadi S., Ahmed A.N.

“…Copper deposits; Deposits; Geology; Learning algorithms; Mineralogy; Static Var compensators; Support vector machines; Three dimensional computer graphics; Alteration zones; Grid search; Grid-search method; Mineralization zone; Model Selection; Particle swarm optimization algorithm; Penalty parameters; Performance; Support vector classifiers; Support vectors machine; Particle swarm optimization (PSO); accuracy assessment; algorithm; classification; computer simulation; copper; geological survey; mineral alteration; mineralization; numerical model; ore deposit; parameterization; performance assessment; porphyry; resource assessment; support vector machine; three-dimensional modeling; Iran…”

Classification of heart disease with machine learning: a comparison of grid search, random search, and Bayesian Optimization by Andi, Tri, Ismail, Amelia Ritahani, Pranolo, Andri, Kusuma, Candra Juni Cahyo

“…Four commonly used machine learning algorithms: Logistic Regression (LR), Support Vector Machine (SVM), K-Nearest Neighbors (KNN), and Gradient Boosting were tested on benchmark datasets from the UC Machine Learning Repository. …”
Get full text
Get full text
Get full text

Checkpointing in selected most fitted resource task scheduling in grid computing by Latip, Rohaya, Lew, Wai San, Chanchary, Fara Habib

“…Our research adds fault tolerance capacity with checkpointing and machine failure, to the current research, Selected Most Fitted (SMF) Task Scheduling for grid computing. …”
Get full text
Get full text

A case study of microarray breast cancer classification using machine learning algorithms with grid search cross validation by Mohd Ali, Nursabillilah, Besar, Rosli, Ab Aziz, Nor Azlina

“…The study involved three machine learning algorithms, random forest (RF), extra tree (ET), and support vector machine (SVM). …”
Get full text
Get full text
Get full text

Optimalisation of a job scheduler in the grid environment by using fuzzy C-mean by Lorpunmanee, Siriluck, Abdullah, Abdul Razak

“…Simulation runs demonstrate that our algorithm leads to better results than the traditional algorithms for scheduling policies used in Grid environment.…”
Get full text

Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform by Alias, Norma, Satam, Noriza, Abd. Ghaffar, Zarith Safiza, Darwis, Roziha, Hamzah, Norhafiza, Islam, Md. Rajibul

“…By the means of higher performance computing, the computation cannot be relying on just one single set of cluster. …”
Get full text
Get full text
Get full text

Replica Creation Algorithm for Data Grids by Madi, Mohammed Kamel

Get full text
Get full text
Get full text
Get full text

Two Stages Transfer Algorithm (TSTT) for independent tasks scheduling in heterogeneous computing systems by Al-Qadhi, Abdulrahman K., Ariffin, Ahmad Alauddin, Latip, Rohaya, Abdul Hamid, Nor Asila Wati, Al-Zubaidi, Ammar S.

“…Task scheduling is critical in heterogeneous systems especially with the huge number of tasks transmitted over grid causing system delay. Since heuristics are proposing methods for solving heterogeneous computing systems, several techniques were proposed for the scheduling on grid computing systems to get better execution time. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

An improved teaching-learning-based optimization for extreme learning machine in floating photovoltaic power forecasting by Mohd Redzuan, Ahmad, Nor Farizan, Zakaria, Mohd Shawal, Jadin, Mohd Herwan, Sulaiman

“…The proposed method achieved superior forecasting accuracy compared to benchmark algorithms including standard teaching-learning-based optimization with extreme learning machine, manta rays foraging optimization with extreme learning machine, moth flame optimization with extreme learning machine, ant colony optimization with extreme learning machine and salp swarm algorithm with extreme learning machine. …”
Get full text
Get full text
Get full text

Optimizing support vector machine parameters using continuous ant colony optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous parameters, there is a need to discretize the continuous value into a discrete value.This discretization process results in loss of some information and, hence, affects the classification accuracy and seek time.This study proposes an algorithm to optimize Support Vector Machine parameters using continuous Ant Colony Optimization without the need to discretize continuous values for Support Vector Machine parameters.Seven datasets from UCI were used to evaluate the performance of the proposed hybrid algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques.Experimental results of the proposed algorithm also show promising performance in terms of computational speed.…”
Get full text
Get full text
Get full text

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

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

Performance evaluation of load balancing algorithm for virtual machine in data centre in cloud computing by Parmesivan, Yuganes, Hasan, Sazlinah, Muhammed, Abdullah

Get full text
Get full text
Get full text

Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

Get full text
Get full text