Search Results - (( developing construction new algorithm ) OR ( java implication based algorithm ))
Search alternatives:
- implication based »
- construction new »
- java implication »
- new algorithm »
-
1
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 -
2
An Efficient Computational Algorithm for Solving Arbitrary Sylvester Matrix Equations in Fuzzy Control Theory (S/O 14179)
Published 2021“…With that, the constructed algorithm is considered as a new contribution to the application of control system theory…”
Get full text
Get full text
Monograph -
3
Ball surface representations using partial differential equations
Published 2015“…Hence, this new algorithm is a viable alternative for constructing generalized Ball surfaces. …”
Get full text
Get full text
Get full text
Thesis -
4
-
5
Customised fitness function of evolutionary algorithm for optimization of car park space / Ahmad Syahir Ab. Aziz
Published 2017“…Genetic algorithm is chosen for the development of the prototype to prove that genetic algorithm is the best technique to implement for optimization. …”
Get full text
Get full text
Thesis -
6
Multi-base number representation in application to scalar multiplication and pairing computation
Published 2011“…Multi-bases number representation is used to construct new versions of Miller’s algorithm. These algorithms are formulated for computing Tate and ate pairing. …”
Get full text
Get full text
Thesis -
7
-
8
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 -
9
Strategies for effective value management practice in construction industry
Published 2017“…The objectives were to develop a new optimisation algorithm and apply the results to control construction project costs. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite
Published 2018“…In line with the upcoming of a new field called search-based software engineering (SBSE), many newly developed t-way strategies adopting meta-heuristic algorithms can be seen in the literature for constructing interaction test suite (such as simulated annealing (SA), genetic algorithm (GA), ant colony optimisation algorithm (ACO), particle swarm optimisation (PSO), harmony search (HS) and cuckoo search (CS). …”
Get full text
Get full text
Get full text
Article -
11
An improved pixel-based and region-based approach for urban growth classification algorithms / Nur Laila Ab Ghani
Published 2015“…The urban growth images obtained are analysed to improve existing classification algorithms. The improved algorithm is constructed by adding new parameter and classification rule to existing algorithm. …”
Get full text
Get full text
Thesis -
12
Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
Published 2008“…The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
Get full text
Get full text
Thesis -
13
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. …”
Get full text
Get full text
Thesis -
14
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
Get full text
Get full text
Get full text
Thesis -
15
Building a French Stemmer Using a Dictionary of French Root Words
Published 1999“…In this thesis, a strong French stemming algorithm based on a dictionary of French root words is developed. …”
Get full text
Get full text
Thesis -
16
Examination timetabling using harmony search algorithm
Published 2015“…The aim is to fulfil the hard constraints as well as the soft constraints to the highest grade possible in order to construct an optimum timetable. In this project, the Harmony Search Algorithm (HSA) has been applied to develop the examination timetable for Kolej Profesional MARA. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
17
Invigilation timetabling system using genetic algorithm (GA) / Shahirah Mohamed Hatim
Published 2011“…This system is developed for the invigilators and with the objective of constructing an invigilation timetable using Genetic Algorithm. …”
Get full text
Get full text
Thesis -
18
-
19
Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition
Published 2010“…In the second stage, the developed variable length genetic algorithm is used to select different sets of lexical cues to constitute the dynamic Bayesian networks' random variables. …”
Get full text
Get full text
Article -
20
Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems
Published 2010“…This thesis focuses on the development of a new stream of crossover within genetic algorithms, called Optimised Crossover Genetic Algorithm (OCGA) for solving combinatorial optimisation problems, which takes into account the objective function in finding the best ofspring solution among an exponentially large number of potential ofspring. …”
Get full text
Get full text
Thesis
