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 4 of 4 for “"Data- och systemvetenskap"”.

  1. Fairness in Communication and Computer Network Design

    In communication networks, fair sharing of resources is an important issue for one main reason. The growth of network capacity is in general not matching the rapid growth of traffic. Consequently, the resources consumed by each user have to be limited. This implies that users cannot always be …

    lund Repository record for Fairness in Communication and Computer Network Design (opens in a new tab)

  2. 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 …

    lund Repository record for Approximation Algorithms for Geometric Networks (opens in a new tab)

  3. Visualization of Guidelines on Computer Networks to Support Processes of Design and Quality Control

    Industrial companies supply products intended to satisfy customers’ needs and requirements. To be competitive and to maintain good economic performance, efficient systems are needed to communicate information and exchange knowledge. Such systems are often referred to as quality systems as they …

    lund Repository record for Visualization of Guidelines on Computer Networks to Support Processes of Design and Quality Control (opens in a new tab)

  4. 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 …

    lund Repository record for Geometric Decompositions and Networks - Approximation Bounds and Algorithms (opens in a new tab)