Search Results - (( java implication _ algorithm ) OR ( problem implementation using (algorithmic OR algorithms) ))
Search alternatives:
- problem implementation »
- implementation using »
- java implication »
-
1
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…The focus of this study is developing a framework of QAPU and hybrid architecture for classical-quantum algorithms. The framework is used to increase the implementation performance of quantum algorithms. …”
Get full text
Get full text
Thesis -
2
A hybrid algorithm for finding shortest path in network routing.
Published 2009“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
Get full text
Article -
3
Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom
Published 2015“…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
Get full text
Get full text
Thesis -
4
An experiment on the performance of shortest path algorithm
Published 2016“…Shortest path algorithms are one of the main algorithms used in most navigation system. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique
Published 2006“…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
Get full text
Get full text
Thesis -
6
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text
Thesis -
7
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text
Thesis -
8
Festive season balancing groceries optimization / Fairuz Mohamed Razi
Published 2012“…This research uses Genetic Algorithms concept and technique to solve an optimization problem in shortage in supply-demand during festive season which is during Hari Raya Aidilfitri. …”
Get full text
Get full text
Thesis -
9
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text
Thesis -
10
Attribute related methods for improvement of ID3 Algorithm in classification of data: A review
Published 2020“…Decision tree is an important method in data mining to solve the classification problems. There are several learning algorithms to implement the decision tree but the most commonly-used is ID3 algorithm. …”
Get full text
Get full text
Get full text
Article -
11
A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali
Published 2012“…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri
Published 2017“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text
Thesis -
13
Optimal path planning algorithm for swarm robots using bat algorithm with mutation (bam)
Published 2022“…However, there is still room for improvement such as implementing the obstacle avoidance algorithm into swarm robot. …”
Get full text
Get full text
Undergraduates Project Papers -
14
The Implementation of Genetic Algorithm in Path Optimization
Published 2005“…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
Get full text
Get full text
Final Year Project -
15
Garbage truck staff duty roster using genetic algorithm / Nadea Suneeza Zulkifli
Published 2017“…This technique is used because studies have shown reasonably good results when genetic algorithms are applied to the staff-scheduling problem. …”
Get full text
Get full text
Thesis -
16
Parallel distributed genetic algorithm development based on microcontrollers framework
Published 2023“…Genetic algorithms are powerful optimizing techniques that are used successfully to solve problems in many different disciplines. …”
Conference paper -
17
Network reconfiguration and control for loss reduction using genetic algorithm
Published 2010“…Two selection methods that are used in Genetic Algorithm are the roulette wheel and tournament selections. …”
Get full text
Get full text
Thesis -
18
Optimization of multi-holes drilling path using particle swarm optimization
Published 2022“…This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
Get full text
Get full text
Thesis -
19
-
20
Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
Published 2008“…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
Thesis
