Search Results - (( _ processing (problems OR problem) algorithm ) OR ( java based optimization algorithm ))
Search alternatives:
- processing »
- java »
-
1
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
2
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization. …”
Get full text
Get full text
Get full text
Monograph -
3
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Offloading heavy data size to a remote node introduces the problem of additional delay due to transmission. Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text
Article -
4
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
5
Web-based expert system for material selection of natural fiber- reinforced polymer composites
Published 2015“…In the exponentially growing material database, selection of optimal material for engineering design is Multi Criteria Decision Making (MCDM) problem as many properties of each material influence the selection process. …”
Get full text
Get full text
Thesis -
6
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013“…The optimization of a computationally intensive algorithm such as this on a mobile platform is challenging due to the limited resources available. …”
Get full text
Get full text
Conference or Workshop Item -
7
Automatic Number Plate Recognition on android platform: With some Java code excerpts
Published 2016“…Hence, the objective of this research is to propose suitable and optimize algorithm for ANPR system on Android mobile phone. …”
Get full text
Get full text
Get full text
Book -
8
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
Get full text
Get full text
Thesis -
9
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
Published 2015“…Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Input-output based relation combinatorial testing using whale optimization algorithm for generating near optimum number of test suite
Published 2025“…This study proposes a combinatorial testing method utilizing the Whale Optimization Algorithm (WOA). The study compares the performance of WOA with various existing strategies, such as Greedy, Density, TVG, Union, ParaOrder, ReqOrder, ITTDG, AURA, Java Algorithm (CTJ), TTSGA, and AFA. …”
Get full text
Get full text
Get full text
Article -
11
A heuristics approach for classroom scheduling using genetic algorithm technique
Published 2017“…The proposed of heuristics approach will prompt a superior utilization of the accessible classroom space for a given time table of courses at the university. Genetic Algorithm through Java programming languages were used in this study and aims at reducing the conflicts and optimizes the fitness. …”
Get full text
Get full text
Article -
12
DEVELOPMENT OF A MULTI-OBJECTIVE OPTIMZATION FRAMEWORK FOR INDUSTRIAL PROCESSES
Published 2014“…Thus, this work focuses on industrial MO problems encountered in process engineering with more than two objectives. …”
Get full text
Get full text
Thesis -
13
Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach
Published 2014“…The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). …”
Get full text
Get full text
Get full text
Article -
14
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. The objectives of this project to set-up Beowulf cluster computer to apply the Travelling Salesman Problem in parallel by using Genetic Algorithms and evaluate sequential algorithms and parallel algorithms by Genetic Algorithms. …”
Get full text
Get full text
Thesis -
15
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
Published 2018“…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
Article -
16
Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri
Published 2020“…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
Get full text
Get full text
Thesis -
17
Monkey Algorithm for Packing Circles with Binary Variables
Published 2019“…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
Get full text
Get full text
Article -
18
Monkey Algorithm for Packing Circles with Binary Variables
Published 2019“…The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. …”
Get full text
Get full text
Article -
19
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…A typical component in QPU is a quantum device that runs quantum algorithms; namely Quantum Algorithm Processing Unit (QAPU). …”
Get full text
Get full text
Thesis -
20
Generic DNA encoding design scheme to solve combinatorial problems
Published 2015“…The complexity of combinatorial problems is classified as NP meaning that algorithms are yet to exist to efficiently solve the problem. …”
Get full text
Get full text
Thesis