Search Results - (( discrete optimization based algorithm ) OR ( parameter optimization based algorithm ))

Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

“…This thesis describes the development of an efficient algorithm for solving nonlinear stochastic optimal control problems in discrete-time based on the principle of model-reality differences. …”
Get full text
Get full text

Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

“…One of the more recent global optimization tools in the area of discrete optimization is known as the discrete filled function method. …”
Get full text
Get full text
Get full text

A Wavelet-Based Particle Swarm Optimization Algorithm for Digital Image Watermarking by Jasni, Mohamad Zain, Tao, Hai, Ahmed, M. Masroor, Abdalla, Ahmed N., Jing, Wang

“…This paper proposes the application of Discrete Wavelet Transform (DWT) into image watermarking by using Particle Swarm Optimization (PSO) which is an evolutionary technique with the stochastic, population-based algorithm for solving this problem. …”
Get full text
Get full text
Get full text

Assisted History Matching by Using Genetic Algorithm and Discrete Cosine Transform by Abdul Rashid, Abdul Hadi

“…Apart from that, the manual way consume too much time, especially when dealing with thousands of well parameters. Hence, this project, which propose the usage of assisted history matching technique with Genetic Algorithm (GA) as the optimization tool and Discrete Cosine Transform (DCT) as the parameter reduction method is carried out in order to achieve the objective of minimizing the time taken to do history matching. …”
Get full text
Get full text

Discrete-time system identification using genetic algorithm with single parent-based mating technique by Zainuddin, Farah Ayiesya

“…Performance indicators included the Akaike Information Criterion (AIC), Bayesian Information Criterion (BIC), and Parameter Magnitude-based Information Criterion 2 (PMIC2). …”
Get full text
Get full text
Get full text
Get full text

A discrete event simulation for utility accrual scheduling in uniprocessor environment by Ahmad, Idawaty, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zukarnain, Zuriati

“…This research has focused on the proposed and the development of an event based discrete event simulator for the existing General Utility Scheduling (GUS) to facilitate the reuse of the algorithm under a common simulation environment. …”
Get full text
Get full text
Get full text

Hybridization of modified sine cosine algorithm with tabu search for solving quadratic assignment problem by Nurdiyana, Jamil

“…Sine Cosine Algorithm (SCA) is a population-based metaheuristic method that widely used to solve various optimization problem due to its ability in stabilizing between exploration and exploitation. …”
Get full text
Get full text

Artificial Bee Colony-based satellite image contrast and brightness enhancement technique using DWT-SVD by Bhandari, A.K., Soni, V., Kumar, A., Singh, G.K.

“…The proposed technique is based on the Artificial Bee Colony (ABC) algorithm using Discrete Wavelet Transform and Singular Value Decomposition (DWT-SVD). …”
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

A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment by Ahmad, Idawaty, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zukarnain, Zuriati

“…Approach: The study focused on the proposed and the development of an event based discrete event simulator for the existing General Utility Scheduling (GUS) to facilitate the reuse of the algorithm under a common simulation environment. …”
Get full text
Get full text
Get full text

Image watermarking optimization algorithms in transform domains and feature regions by Tao, Hai

“…The achieved tradeoffs from these techniques between imperceptibility and robustness are controversial.To solve this problem,this study proposes the application of artificial intelligent techniques into digital watermarking by using discrete wavelet transform (DWT) and singular value decomposition (SVD).To protect the copyright information of digital images,the original image is decomposed according to two-dimensional discrete wavelet transform.Subsequently the preprocessed watermark with an affined scrambling transform is embedded into the vertical subband (HLm) coefficients in wavelet domain without compromising the quality of the image.The scaling factors are trained with the assistance of Particle Swarm Optimization (PSO).A new algorithmic framework is used to forecast feasibility of hypothesized watermarked images.In addition,the novelty is to associate the Hybrid Particle Swarm Optimization (HPSO),instead of a single optimization,as a model with SVD.To embed and extract the watermark,the singular values of the blocked host image are modified according to the watermark and scaling factors. …”
Get full text
Get full text

Delay and energy-aware routing for efficient data collection in wireless sensor networks / Ihsan Ali by Ihsan , Ali

“…Both Bat Algorithm parameters and AFW parameters are adaptively tuned to balance exploration and exploitation throughout the optimization process. …”
Get full text
Get full text
Get full text

Dynamic layout algorithms for wireless field hockey strategy system by Canda, Roger, K. Subramaniam, Shamala, A., Amri

“…The proposed algorithm was evaluated extensively through discrete - event simulations. …”
Get full text
Get full text

A hybrid Q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem by Kamal Z., Zamli, Fakhrud, Din, Ahmed, Bestoun S., Bures, Miroslav

“…The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. …”
Get full text
Get full text
Get full text
Get full text

Fuzzy Adaptive Tuning of a Particle Swarm Optimization Algorithm for Variable-Strength Combinatorial Test Suite Generation by Kamal Z., Zamli, Ahmed, Bestoun S., Mahmoud, Thair, Afzal, Wasif

“…Research has shown that stochastic population-based algorithms such as particle swarm optimization (PSO) can be efficient compared to alternatives for VS-CIT problems. …”
Get full text
Get full text
Get full text

Mobile data gathering algorithms for wireless sensor networks by Ghaleb, Mukhtar Mahmoud Yahya

“…In this research, a Mobile Data Gathering based Network Layout (MDG-NL) algorithm is proposed. …”
Get full text
Get full text

Optimizing Visual Sensor Coverage Overlaps for Multiview Surveillance Systems by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

“…Then, the minimization and the maximization arrangements of the coverage overlapping are formulated as discrete optimization problems. The obtained solutions from the dynamic programming technique are evaluated with respect to local and global greedy search algorithms. …”
Get full text
Get full text

Optimizing Visual Sensor Coverage Overlaps for Multiview Surveillance Systems by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

“…Then, the minimization and the maximization arrangements of the coverage overlapping are formulated as discrete optimization problems. The obtained solutions from the dynamic programming technique are evaluated with respect to local and global greedy search algorithms. …”
Get full text
Get full text

Speech compression using compressive sensing on a multicore system by Gunawan, Teddy Surya, Khalifa, Othman Omran, Shafie, Amir Akramin, Ambikairajah, Eliathamby

“…The performance of overall algorithms will be evaluated based on the processing time and speech quality. …”
Get full text
Get full text

Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak by Emily Sing Kiang, Siew

“…The model employs a two-level structure, where the first level uses standard soft constraints as the objective function to evaluate solution quality, while the second level dynamically adapts to faculty-specific preferences. A constructive algorithm was developed to generate an initial feasible solution, which was subsequently refined using two primary approaches to evaluate their efficiency: Iterative Threshold Pipe Variable Neighborhood Descent (IT-PVND), and a modified Whale Optimization Algorithm (WOA). …”
Get full text
Get full text
Get full text
Get full text