Search Results - (( parallel optimization path algorithm ) OR ( global distribution issues algorithm ))*

Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

“…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
Get full text
Get full text

Minimizing machining airtime motion with an ant colony algorithm by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

Get full text
Get full text

OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM by Zain Ali, Noohul Basheer, Noras, James

Get full text
Get full text

Clock Distribution Network Building Algorithm For Multiple Ips In System On A Chip by Tan , Tze Liang

“…When the setup is done, the global CDN is build and routed. The algorithm checks for clock skew and scenic routing issues before proceeding to shield the global CDN to prevent cross-talk issues. …”
Get full text
Get full text

Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

“…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
Get full text
Get full text
Get full text

A novel large-bit-size architecture and microarchitecture for the implementation of Superscalar Pipeline VLIW microprocessors by Lee, Weng Fook

“…Different adder architectures are investigated for suitability on synthesis implementation of large data bus size adder for efficient usage within the ALU. An adder algorithm using repetitive constructs in a parallel algorithm that allows for efficient and optimal synthesis for large data bus size is proposed as a suitable implementation for the adder within the ALU. …”
Get full text

A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

“…A tree visualisation was constructed based on its connectivity to enable the generation of formulae for optimal diameter and average optimal path lengths. …”
Get full text
Get full text

Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques by Mustafa, Ahmed Sudad

“…In this thesis, a hybrid detection algorithm mechanism has been proposed which combines two detection algorithms based on nodes’ trustworthiness and energy consumption in a parallel manner in order to detect the black hole nodes. …”
Get full text
Get full text
Get full text

Chaos search in fourire amplitude sensitivity test by Koda, Masato

Get full text
Get full text
Get full text

Enhancing the QoS performance for mobile station over LTE and WiMAX networks / Mhd Nour Hindia by Hindia, Mhd Nour

“…On the first level, bankruptcy and shapely value algorithm fairly distribute resources among smart grid applications. …”
Get full text
Get full text

Optimized routing algorithm for mobile multicast source in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Anwar, Farhat, Ahmed, Gharib Subhi Mahmoud

“…Mobility considerations in multicast algorithm design usually focus issues of mobile receivers while few researches emphasize on mobile multicast sources issues. …”
Get full text
Get full text
Get full text
Get full text

Efficient task scheduling strategies using symbiotic organisms search algorithm for cloud computing environment by Sa'ad, Suleiman

“…To solve the issue of local optima entrapment, the concept of diversifying the local search space by enhancing SOS named eDSOS approach to avoid entrapment in local optima for global convergence. …”
Get full text
Get full text

Modified Parameters of Harmony Search Algorithm for Better Searching by Nur Farraliza, Mansor, Abas, Z.A, Shibghatullah, A.S., Rahman, A.F.N.A

“…The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems. …”
Get full text
Get full text

Parameter estimation in computational systems biology models: a comparative study of initialization methods in global optimization by Muhammad Akmal, Remli, Nor Syahidatul Nadiah, Ismail, Noor Azida, Sahabudin, Nor Bakiah, Abd Warif

“…Estimating parameters values is difficult and time-consuming process due to their highly nonlinear and huge number of kinetic parameters involved. Global optimization method based on an enhanced scatter search (ESS) algorithm is a suitable choice to address this issue. …”
Get full text
Get full text
Get full text

Hybrid MPPT algorithm for mismatch photovoltaic panel application / Muhammad Iqbal Mohd Zakki by Mohd Zakki, Muhammad Iqbal

“…A distributed architecture of MPPT (DMPPT) system is proposed to solve the module mismatched, and partial shading issues. …”
Get full text
Get full text

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

“…One of the main issues in genetic k-means based algorithms is their sensitivity to outliers and unevenly distributed clusters due to the mean compromised computations. …”
Get full text
Get full text

Some families of count distributions for modelling zero-inflation and dispersion / Low Yeh Ching by Low, Yeh Ching

“…For parameter estimation, the simulated annealing global optimization routine and an EM-algorithm type approach for maximum likelihood estimation are studied. …”
Get full text
Get full text

Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

“…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…Since scheduling and mapping fall into NP problems, and there is no efficient exact solution for solving scheduling and mapping, the second challenge in HPAs is optimization. Meta-heuristic algorithms have widely used in HPAs due to their global optimization ability. …”
Get full text
Get full text

Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Get full text