Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 29 for “"ALGORITHM CONVERGENCE"”.
-
Fast adaptive algorithms for signal separation
LMS and RLS type algorithms are suggested for decorrelation of multi-channel systems outputs. These algorithms act as signal separators when applied to unknown linear combinations of the inputs. The performance of the suggested algorithms is compared with that of the conventional LMS and RLS …
-
Efficient Hierarchical Global Motion Planning for Autonomous Vehicles
… decidedly non-trivial, including issues such as algorithm convergence, its correspondence to system controllability, optimality of solution, computational complexity, and dynamic environments. In response to these challenges, a hierarchical algorithm will be introduced that provides (a) decreased …
-
Random walk population sizing as a model of decision making in a deceptive schema partition
… been shown to be accurate predictors of genetic algorithm convergence. The random walk model incorporates and improves upon previous work in population sizing. This research investigates the ability of the random walk model to predict the underlying genetic mechanisms of schema processing. These …
-
Genetiniai algoritmai ir jų taikymas gamtos ir tiksliuosiuose moksluose /
This thesis examines genetic algorithms and their variations applied to optimization problems, with a particular focus on genetic and memetic algorithms. Other metaheuristic algorithms are also applied to the Sudoku solving problem for comparison. The thesis reviews the main principles of genetic …
-
Nonlinear State Estimation with Application to Communication Satellites
… the invariant imbedding nonlinear filter. A new algorithm for nonlinear estimation is proposed which combines the invariant imbedding approach and the stochastic approximation algorithm for adaptively estimating the filter gain. The new algorithm is an iterative scheme which does not require …
-
Distributed Learning with Automated Stepsizes
… for optimization problems play a crucial role in algorithm convergence, where the stepsize must undergo tedious manual tuning to obtain near-optimal convergence. Recently, an adaptive method for automating stepsizes was proposed for centralized optimization. However, this method is not directly …
-
A Case Study for Progressive Algorithms - An Investigation into Progressive Extraction of Intermediate Solutions for The Weighted Interval Scheduling Problem
Asserted convergence characteristics shared by all serial algorithms have traditionally not been as prominent a measure of quality as time complexity has been. In instances relying on the exploration of large datasets, a convergence bound on interactively guided exploration approaches could act …
-
On performance of a Pressure-Projection algorithm for incompressible Navier Stokes
… time accurate implicit Galerkin finite element algorithm for the incompressible Navier Stokes equations is assessed for convergence and conservation properties. The algorithm inherits it's philosophy from the group of algorithms known as Pressure Projection methods. The implementation of such a …
-
Exploration of Densities from a Bayesian Perspective
… and provide theoretical guarantees for the algorithm convergence, as well as inspecting it’s associated risk bounds. VB often approximates an unknown density with a density from a known class (e.g. Gaussian) via a ‘close match’ (Kullback–Leibler divergence) metric. The second chapter is …
-
Improvements to an analytical multiple-shooting approach for optimal burn-coast-burn ascent guidance
… control problem more sensitive and increase algorithm convergence difficulties. This work presents detailed improvements to an analytical multiple-shooting (AMS) method for reliable generation of the optimal exo-atmospheric ascent trajectory. The trajectory consists of two burns separated by …
-
Improving binary optimization algorithms using genuine uniform initialization
Population-based metaheuristic algorithms play a crucial role in solving complex optimization problems. The effectiveness of these algorithms is significantly influenced by the initial population of candidate solutions. This thesis investigates the critical aspect of initialization in …
-
Traffic assignment models : applicability and efficacy
… costs. In particular, we prove the theoretical convergence of conventional solution methods for this problem, and analyze convergence behavior for these methods. We also show how a set of real world interactions such as merge models can be modeled using these type of symmetric interactions. …
-
Limited-Communication Distributed Model Predictive Control for HVAC Systems
… Distributed Model Predictive Control algorithm for networks with constrained discrete-time linear processes as local subsystems. The introduced algorithm has an iterative and cooperative framework with neighbor-to-neighbor communication structure. Convergence to a centralized solution …
-
Hybridizing constraint consensus methods with evolutionary algorithms for constrained optimization
… In the literature, many Evolutionary Algorithms (EAs) have been reported for solving COPs. In those algorithms, the constraint handling is recognized as a very important component. However, almost all algorithms deal with constraints indirectly. Basically, in every generation, the …
-
IMPLEMENTATION AND OPTIMISATION OF MICROWAVE MEDICAL IMAGING BASED ON THE MULTIPLE-FREQUENCY DBIM-TWIST ALGORITHM
… an inverse problem. In this thesis, a novel DBIM algorithm based on the TwIST method is proposed to reconstruct the complex permittivity of 2-D anatomically realistic numerical breast phantoms. A combined optimisation of the algorithm parameters is applied to improve the quality of reconstructions …
-
Some Problems Concerning the Generalized Hyperbolic and Related Distributions
… ort. Here, the approach is to obtain a reliable algorithm which, for a given /λ/∈ [0,90], can identify a sufficiently large value of Kλ(z )to obtain accurate approximate value of Kλ (z) with a definite number of terms. Consequently, computational and mathematical difficulties which are due to Kλ …
-
Stability And Controls For Stochastic Dynamic Systems
… and hidden Markov chain formulations and convergence for each case is achieved. In Chapter 2, stability analysis of benchmark linear scalar jump diffusion is studied first. We presented the conditions for exponential p stable and almost surely exponentially stable for SDE and that of …
-
An adaptive algorithm for direct conversion receivers: Architecture and performance analysis
An adaptive algorithm is proposed in this thesis to remove in-phase and quadrature (I/Q) mismatch, direct current (DC) offsets, flicker noise and inter-symbol interference (ISI) simultaneously in a direct conversion receiver (DCR). I/Q mismatch is cancelled by a real valued adaptive mismatch …
-
Advanced Evolutionary Computation For Dynamic And Multi-Task Optimization Via Efficient Knowledge Transfer
… the importance of KT, proposing novel EC algorithms for efficiently solving DOP and MTOP. In DOP, a challenge lies in effectively utilizing historical information to accelerate algorithm convergence. This requires solutions for selecting and updating historical data and ensuring its …
-
Trading with Competition: Inventory, Liquidity and Flow
… and use this to motivate an iterative numerical algorithm. Convergence of this numerical algorithm yields the pricing strategy of a mean-field Nash equilibrium. Properties of the equilibrium pricing strategies and overall market dynamics are then investigated, in particular how they depend on the …
Page 1 of 2