Search for dissertations about: "minimum weight"
Showing result 1 - 5 of 79 swedish dissertations containing the words minimum weight.
-
1. Progress in Hierarchical Clustering & Minimum Weight Triangulation
Abstract : In this thesis we study efficient computational methods for geometrical problems of practical importance and theoretical interest. The problems that we consider are primarily complete linkage clustering, minimum spanning trees, and approximating minimum weight triangulation. Below is a list of the main results proved in the thesis. READ MORE
-
2. Ternary Codes with Weight Constraints
Abstract : We study the problem of maximizing the size of a ternary block code with given length and minimum Hamming distance. The problem is further restricted in two different ways. Either we require all codewords to have constant Hamming weight, or we require all codewords to have constant composition. READ MORE
-
3. Quasi-analytical Modelling and Optimisation Techniques for Transport Aircraft Design
Abstract : The research work presented here focuses on the subject oftransport aircraft design at the pre-design or conceptuallevel. The primary topics addressed are: (1) generation of avast array of new quasi-analytical expressions to permit aconceptual treatment of commercial and business transportaircraft with adequate sensitivity for more advanced tradestudies; (2) review and adoption of a method to predictstability and control characteristics (using the Mitchellmethod); (3) a study of the relative merits between variousmethods in facilitating an expedient and robust constrainedmulti-objective optimisation result within the context oftraditional conceptual design problems (Genetic Algorithms andNelder-Mead Simplex search); (4) creation of a software packageas a new and unique conceptual tool that permits the generationof design proposals in an accurate yet expeditious manner; and,(5) practical demonstration of the new conceptual designsoftware package by undertaking some actual aircraft designproposals. READ MORE
-
4. Path-planning with obstacle-avoiding minimum curvature variation B-splines
Abstract : We study the general problem of computing an obstacle-avoiding path that, for a prescribed weight, minimizes the weighted sum of a smoothness measure and a safety measure of the path. We consider planar curvature-continuous paths, that are functions on an interval of a room axis, for a point-size vehicle amidst obstacles. READ MORE
-
5. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization
Abstract : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. READ MORE