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 5 of 5 for “"numerisk analys"”.
-
Some Extensions of Poincaré-Bendixson Theory Applied to a Resonant Converter.
In this thesis existence and uniqueness of limit cycles are shown for a resonant converter, by extending Poincaré-Bendixson theory to non-smooth vector fields. We discuss relevant control theory and the role of simulations.
-
Approximation Algorithms for Geometric Networks
The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. A geometric network is, in its abstract form, a set of vertices, pairwise connected with an edge, such that …
-
Resource-Constrained Embedded Control and Computing Systems
This thesis deals with methods for handling resource constraints in embedded control systems and real-time computing systems. By dynamic feedback-based resource scheduling it is possible to achieve adaptability andincreased performance for these systems. A feedback scheduling strategy is presented, …
-
Consensus Algorithms for Trees and Strings
This thesis studies the computational complexity and polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas …
-
Geometric Decompositions and Networks - Approximation Bounds and Algorithms
In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. We present several approximation algorithms for this problem, and also some lower bounds on the number of …