Sökning: "convex"
Visar resultat 16 - 20 av 338 avhandlingar innehållade ordet convex.
16. Covering uniformly distributed points by convex scanning sets
Sammanfattning : .... LÄS MER
17. Fixed parameter algorithms and other results for convex patitions
Sammanfattning : It is known that the minimum edge length convex partition MWCP of polygons with holes (an example of a PSLG) is NP-hard. Partitioning polygons with holes into the minimum number of convex polygons MNCP is also known to be NP-hard. LÄS MER
18. Convex Optimization for Assignment and Generalized Linear Regression Problems
Sammanfattning : This thesis considers optimization techniques with applications in assignment and generalized linear regression problems. The first part of the thesis investigates the worst-case robust counterparts of combinatorial optimization problems with least squares (LS) cost functions, where the uncertainty lies on the linear transformation of the design variables. LÄS MER
19. Convex Duality Approach to Robust Stabilization of Uncertain Plants
Sammanfattning : In this thesis we are study the problem of designing the controllers that are robust with respect to the parametric uncertainty. In Part I "The Rank-One Problem" we consider the class of systems with restriction that the structure of uncertainty is limited to a vector. LÄS MER
20. Minkowski Measure of Asymmetry and Minkowski Distance for Convex Bodies
Sammanfattning : This thesis consists of four papers about the Minkowski measure of asymmetry and the Minkowski (or Banach-Mazur) distance for convex bodies.We relate these two quantities by giving estimates for the Minkowski distance in terms of the Minkowski measure. LÄS MER
