Search Results - (( java application optimized algorithm ) OR ( problem implementation new algorithm ))
Search alternatives:
- problem implementation »
- optimized algorithm »
- implementation new »
- java application »
- new algorithm »
-
1
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
2
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text
Conference or Workshop Item -
3
Route Optimization System
Published 2005“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text
Final Year Project -
4
-
5
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text
Article -
6
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 -
7
Ant colony optimization algorithm for load balancing in grid computing
Published 2012Get full text
Get full text
Get full text
Monograph -
8
AAβ public key cryptosystem - a new practical asymmetric implementation based on the square root problem
Published 2012Get full text
Get full text
Get full text
Conference or Workshop Item -
9
Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
Published 2008“…This thesis describes the implementations of new parallel and sequential algorithms for electromagnetic wave propagation from a monopole antenna. …”
Get full text
Get full text
Thesis -
10
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…This algorithm has been tested and implemented successfully via a dual beam optical scanning system.…”
Get full text
Get full text
Thesis -
11
A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali
Published 2012“…Since subexponential-time algorithm is known for ordinary discrete logarithm problem and integer factorization problem and not for elliptic curve discrete logarithm problem, the algorithm presented for the digital signature in this study has substantially greater strength per key bit than in other digital signature algorithm…”
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
12
A Parallel new high order iterative algorithm on shared memory multiprocessors parallel computer
Published 2004“…A new fast high-order points iterative algorithm of O(h4) applied to linear systems arising from discretization of 2D Poisson problem was recently introduced by the writers. …”
Get full text
Get full text
Get full text
Article -
13
-
14
Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
Published 2006“…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
Get full text
Get full text
Thesis -
15
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
Book Section -
16
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 -
17
An Efficient Parallel Quarter-sweep Point Iterative Algorithm for Solving Poisson Equation on SMP Parallel Computer
Published 2000“…In this paper, the parallel implementation of the new algorithm with the chessboard (CB) strategy on Symmetry Multi Processors (SMP) parallel computer was presented. …”
Get full text
Get full text
Article -
18
-
19
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…In order to develop a new algorithm for the course scheduling problem, this research follows the experimental research methodology that consist of problem analysis, designing algorithm, implementing algorithm as a computer program in order to examine the results, analyzing the results, and if necessary improving the algorithm by doing all those activities over and over again. …”
Get full text
Get full text
Get full text
Thesis -
20
Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid
Published 2012“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text
Monograph
