Search Results - (( developing starter _ algorithm ) OR ( java application optimized algorithm ))
Search alternatives:
- optimized algorithm »
- developing starter »
- java application »
-
1
Butterfly Triple System Algorithm Based on Graph Theory
Published 2022“…Basically, in this algorithm development, a starter of cyclic near-resolvable ((v-1)/2)-cycle system of the 2-fold complete graph 2Kvis employed to construct the starter of cyclic ((v-1)/2)-star decomposition of 2Kv. …”
Get full text
Get full text
Get full text
Article -
2
Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation
Published 2021“…This new algorithm is still in the early stage and under development for the generation of the half wing of butterfly representation. …”
Get full text
Get full text
Get full text
Article -
3
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 -
4
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 -
5
New algorithm for listing all permutations
Published 2010“…In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. …”
Get full text
Get full text
Get full text
Article -
6
A new starter sets generation method by fixing any element under exchange restriction
Published 2016“…A new method is developed for starter sets generation namely STARSET2 based on exchange where any element can be selected randomly to be fixed.The result showed that no redundancy of starter sets is occurring and no equivalence starter sets are obtained.…”
Get full text
Get full text
Article -
7
A new method for starter sets generation by fixing any element
Published 2015“…a new permutation technique based on distinct starter sets was introduced by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile new strategies for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method.However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with.It would be interesting to derive new strategy by fixing an element in any position. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
8
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 -
9
SEALiP: A simple and efficient algorithm for listing permutation via starter set method
Published 2013“…Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. …”
Get full text
Get full text
Get full text
Article -
10
-
11
Parallel strategy for starter sets to list all permutation based on cycling restriction
Published 2011“…This paper presents a parallel implementation of a new permutation generation method.This permutation generation method is based on the starter sets for listing all the n! permutations.The sequential algorithm is developed and parallelized for parallel computing by integrating with Message Passing Interface (MPI) libraries. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Generalized Triad Design Algorithms
Published 2012“…In addition, new constructions for the starter of a compatible factorization on v objects, a SCF(v), and new algorithms for a CF(v) was developed. …”
Get full text
Get full text
Thesis -
13
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 -
14
Developing triad design algorithms based on compatible factorization
Published 2011“…These processes have helped us develop algorithm for triad design, the objective of this study.A new technique for triad design algorithm, known as Interval Generation Method was employed to construct TD(6n + 1) and TD(6n + 5).This method depends on analyzing the pattern of triples in the design to build starters.We begin by producing starters from Interval Generation Method as the initial block to begin with.Then the algorithm begins by cycling modular v from the initial block and finishes when the process approaches the initial block.The algorithms for TD(6n+1) and TD(6n+5) are presented in Chapter 4 and 5, respectively.As the entire study depends mainly on TD(v) algorithms, new and remarkable theorems and lemmas for TD(v) development are presented and proved.…”
Get full text
Get full text
Get full text
Monograph -
15
Three phase induction motor coupled to DC motor in hybrid electric vehicle application
Published 2011“…The DC starter-generator has been tested in both motoring (engine starting) and generating modes with the starter-generator mounted in the vehicle. …”
Get full text
Get full text
Thesis -
16
Developing an algorithm for triad design
Published 2012Get full text
Get full text
Get full text
Article -
17
A new parallel model for starter sets generation via exchanging two elements
Published 2019“…In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. …”
Get full text
Get full text
Article -
18
-
19
Ant colony optimization algorithm for load balancing in grid computing
Published 2012Get full text
Get full text
Get full text
Monograph -
20
Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method
Published 2019“…We provide an example for case n = 4 and 5 to exemplify the algorithms. Furthermore, the calculation for order of complexity is also presented for generating distinct half wing and hamiltonian circuit using starter set method.…”
Get full text
Get full text
Get full text
Article
