Search Results - (( dynamic bandwidth optimisation algorithm ) OR ( dynamic candidate generation algorithm ))

Efficient reconfigurable architectures for 3-D medical image compression by Ahmad, Afandi

“…These applications require continuous hardware servicing, and as a result dynamic partial recon�guration (DPR) has been introduced. …”
Get full text
Get full text

Fuzzy Mixed Assembly Line Sequencing and Scheduling Optimization Model Using Multiobjective Dynamic Fuzzy GA by Zahari, Taha, Farzad, Tahriri, Siti Zawiah, Md Dawal

“…The enhanced algorithm dynamically adjusts the population size, number of generations, tournament candidate, crossover rate, and mutation rate compared with using fixed control parameters. …”
Get full text
Get full text
Get full text

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text

Solving ump examination timetabling problem using dynamic exploration step counting hill climbing algorithm by Chang, Ling Shing

“…Then, the initial solution is improved using our enhanced algorithm called dynamic exploration step counting hill climbing (DESCHC). …”
Get full text
Get full text

A PI based coordinated maximum power point tracking controller for grid connected photovoltaic system / Md Haidar Islam by Md Haidar, Islam

“…Photovoltaic (PV) sources are predicted to become one of the biggest contributors to electricity generation among all renewable energy generation candidates by 2040. …”
Get full text
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

Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model by Raja Wahab, Raja Azhan Syah

Get full text
Get full text
Get full text

Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things by Hadi, Ahmed Adnan

“…Hence, the algorithm must overcome the problem of dynamic updates in the internal parameters or counter the concept drift. …”
Get full text
Get full text

A competitive co-evolutionary approach for the nurse scheduling problem by Mohamad Nazri, Maizatul Farhana, Mohd Yusoh, Zeratul Izzah, Basiron, Halizah, Daud, Azlina

“…This study proposes a competitive co-evolutionary algorithm for the NSP that introduces adaptive adversarial evaluation, where candidate schedules are assessed under dynamic competitive pressure to expose structural weaknesses and guide evolution more effectively. …”
Get full text
Get full text
Get full text

Design of interacting multi-stable nucleic acids for molecular information processing. by Ramlan, Effirul Ikhwan, Zauner, K.P.

“…Furthermore, the thermodynamic properties of the generated candidates are within the same approximation as the customised trans-acting switching molecules reported in the laboratory.…”
Get full text
Get full text