Search Results - (( problem using new algorithm ) OR ( java application testing algorithm ))
Search alternatives:
- application testing »
- testing algorithm »
- java application »
- new algorithm »
- using new »
-
1
Classification System for Heart Disease Using Bayesian Classifier
Published 2007“…This is a new approach that able to use by doctors to rectify the heart problem. …”
Get full text
Get full text
Thesis -
2
Developing an intelligent system to acquire meeting knowledge in problem-based learning environments
Published 2006“…Similarly, the algorithm proposed in MALESAbrain can, be used to deal, the problem of conducting a meeting among learners to solve problems. …”
Get full text
Get full text
Get full text
Article -
3
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…The resource allocation 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 -
4
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
Get full text
Get full text
Get full text
Monograph -
5
Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly
Published 2019“…On the Construction phase, the development of the prototype has been started. All the algorithm for the engine has been developed by using Java script language. …”
Get full text
Get full text
Thesis -
6
Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection
Published 2008“…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
Get full text
Get full text
Thesis -
7
Resource management in grid computing using ant colony optimization
Published 2011“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text
Monograph -
8
RSA Encryption & Decryption using JAVA
Published 2006“…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
Get full text
Get full text
Final Year Project -
9
Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application
Published 2020“…Performance Testing is used to test the performance of algorithm implementations in applications. …”
Get full text
Get full text
Journal -
10
-
11
Implementation of (AES) Advanced Encryption Standard algorithm in communication application
Published 2014“…The concept of ABS algorithm was firstly studied, including the definition, historical background, and a brief comparison was made between the ABS algorithm with other types of algorithm. …”
Get full text
Get full text
Undergraduates Project Papers -
12
Development of optimization Alghorithm for uncertain non-linear dynamical system
Published 2004“…The new algorithms also boast faster contractions. Both new algorithms performed better than DISOPE. …”
Get full text
Get full text
Monograph -
13
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 -
14
Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
Published 2018“…The new hybrid algorithm has been applied on different cases of Knapsack problem with different dimensions. 20 case studies have been evaluated by the new hybrid algorithm. …”
Get full text
Get full text
Get full text
Get full text
Article -
15
Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
Published 2008“…The solutions to both parts are discussed in details in this thesis. 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 -
16
-
17
Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique
Published 2008“…The new algorithm can effectively be used to tackle large scale optimization problems.Computational tests show promises of the new algorithm.…”
Get full text
Get full text
Get full text
Article -
18
-
19
A discrete simulated kalman filter optimizer for combinatorial optimization problems
Published 2022“…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
Get full text
Get full text
Thesis -
20
New heuristic function in ant colony system for the travelling salesman problem
Published 2012“…However, one part of the algorithm, called heuristic function, is not updated at any time throughout the process to reflect the new information discovered by the ants.This paper proposes an Enhanced Ant Colony System algorithm for solving the Travelling Salesman Problem.The enhanced algorithm is able to generate shorter tours within reasonable times by using accumulated values from pheromones and heuristics.The proposed enhanced ACS algorithm integrates a new heuristic function that can reflect the new information discovered by the ants. …”
Get full text
Get full text
Get full text
Conference or Workshop Item
