-
461
MaxD K-Means: A clustering algorithm for auto-generation of centroids and distance of data points in clusters
Published 2012“…The results from the new algorithm show that the number of iteration improves tremendously, and the number of iterations is reduced by confirming an improvement rate is up to 78%.…”
Get full text
Article -
462
Shadow Detection Using Double-Threshold Pulse Coupled Neural Networks
Published 2016“…To solve this problem, two different dynamic thresholds that iteratively alter are designed. The upper and lower limits of detecting shadows are determined respectively by a higher threshold that decreases iteratively and a lower one that increases iteratively. …”
Get full text
Get full text
Conference Paper -
463
Asynchronous control network optimization using fast minimum cycle time analysis
Published 2010“…We also propose a fast algorithm for iterative minimum-cycle-time analysis. The novelty of the proposed algorithm is that it takes advantage of the fact that only small modifications are made to the control network during each optimization iteration. …”
Get full text
Get full text
Journal Article -
464
Successive over relaxation method in solving two-point fuzzy boundary value problems
Published 2013“…The approximation solver towards system of linear equations is described through the implementation of the Gauss-Seidel (GS) and Successive Over Relaxation (SOR) iterative methods. Then several numerical experiments were shown to illustrate the effectiveness of SOR iterative method compared with the GS method.…”
Get full text
Conference or Workshop Item -
465
Shape-simplifying image abstraction
Published 2011“…The framework demonstrates the constrained MCF technique, in an iterative and incremental manner, to simplify the image content. …”
Get full text
Final Year Project (FYP) -
466
Secure algorithm based data aggregation for sensor networks
Published 2016“…Robust Iterative Filtering is than shown to not work because of a wrong assumption that the sum of bias will be zero. …”
Get full text
Final Year Project (FYP) -
467
Diagonal quasi-newton's method for large-scale systems of nonlinear equations
Published 2011“…This method is simple to implement and converges rapidly. Nevertheless, an iteration of this method turns out to be computational expensive,this is due to the fact that the method requires the computation and storage of the Jacobian matrix, the floating point operations is O(n)3 and as well as the solution of an n linear systems in each iteration. …”
Get full text
Thesis -
468
Simulation based optimisation on cloud
Published 2021“…Simulation-based optimisation (SBO) aims to obtain a set of optimal simulation parameters by combining the use of 2 steps into an iterative process – simulation modelling and optimisation. …”
Get full text
Final Year Project (FYP) -
469
Beamforming for wireless communications
Published 2008“…We classify the techniques into two categories: non-iterative beampattern synthesis algorithms and iterative beampattern synthesis algorithms. …”
Get full text
Thesis -
470
Response surface methodology with prediction uncertainty : a multi-objective optimisation approach
Published 2013“…Overall, the method iterates through initial experimental design, empirical modelling and model-based optimisation to allocate promising experiments for the next iteration. …”
Get full text
Get full text
Journal Article -
471
A symmetric rank-one method based on extra updating techniques for unconstrained optimization.
Published 2011“…In particular, we discuss how to consider a criterion for indicating at each iteration whether it is necessary to employ extra updates. …”
Get full text
Article -
472
A framework for design information management system for architects
Published 2010“…Architectural design is characterised by rework (iteration). Many of the available process models are not capable of representing these iterative processes. …”
Get full text
Thesis -
473
Eigen is all you need: efficient lidar-inertial continuous-time odometry with internal association
Published 2024“…Two, CT-LIO benefits more from the correct association than the number of iterations. Based on these ideas, we implement our method with a customized solver where the feature association process is performed immediately after each incremental step, and the solution can converge within a few iterations. …”
Get full text
Journal Article -
474
Application and efficiency evaluation of 4-point newton explicit group to solve 2d porous medium equation
Published 2022“…A large and sparse nonlinear system is iteratively solved using the Newton method and the 4-point explicit group technique. …”
Get full text
Get full text
Article -
475
A new Newtons method with diagonal Jacobian approximation for systems of nonlinear equations
Published 2010“…Problem statement: The major weaknesses of Newton method for nonlinear equations entail computation of Jacobian matrix and solving systems of n linear equations in each of the iterations. Approach: In some extent function derivatives are quit costly and Jacobian is computationally expensive which requires evaluation (storage) of n×n matrix in every iteration. …”
Get full text
Article -
476
A binary particle swarm optimization approach to optimize assembly sequence planning
Published 2012“…Permutation encoding of sequences is used to represent particles, then those particles are strictly subjected to a precedence constraint matrix at which only the feasible sequences will be iterated in the process. An archive is used in storing the feasible sequences and a swap mechanism is used to identify the feasible sequences for iteration. …”
Article -
477
A new Quarter-Sweep Arithmetic Mean (QSAM) method to solve diffusion equations
Published 2009“…The formulation of the QSAM method is developed by combining the concept of the quartersweep iteration and the Arithmetic Mean (AM) method known as one of two-step iterative methods. …”
Get full text
Article -
478
A new Quarter Sweep Arithmetic Mean (QSAM) method to solve diffusion equations
Published 2009“…The formulation of the QSAM method is developed by combining the concept of the quartersweep iteration and the Arithmetic Mean (AM) method known as one of two-step iterative methods. …”
Get full text
Article -
479
Solving delay differential equations using intervalwise partitioning by Runge–Kutta method
Published 2001“…Initially the whole system is considered as nonstiff and solved using simple iteration, in the event that stiffness is indicated, the whole system is considered as stiff and solved using Newton iteration. …”
Get full text
Article -
480
A new Quarter Sweep Arithmetic Mean (QSAM) method to solve diffusion equations
Published 2009“…The formulation of the QSAM method is developed by combining the concept of the quarter- sweep iteration and the Arithmetic Mean (AM) method known as one of two-step iterative methods. …”
Article