Search for dissertations about: "Data Vetenskap"
Showing result 16 - 20 of 221 swedish dissertations containing the words Data Vetenskap.
-
16. Shadows of Cavernous Shades: Charting the Chiaroscuro of Realistic Computing
Abstract : During the early 1990s, a novel style of programming often referred to as component-oriented programming quickly grew popular as the state-of-the-art in graphical user interface and client/server development on Windows-based personal computers, largely in competition with object-oriented programming, a partly similar, partly different programming paradigm, with which component-orientation is often compared, combined, and confused. Also during the 1990s, the world-wide web spread its arachnoid gossamer over the globe with deep-ranging ramifications for software component technology. READ MORE
-
17. Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry
Abstract : The main contributions of this thesis are in the area of approximation and online algorithm design and derivation of lower bounds on the approximability for a number of combinatorial optimization problems with applications in computational biology and computational geometry. Approximation and online algorithms are fundamental tools used to deal with computationally hard problems and problems in which the input is gradually disclosed over time. READ MORE
-
18. Approximation and online algorithms with applications in robotics and computational biology
Abstract : Approximation and online algorithms with applications in robotics and computational biology.... READ MORE
-
19. Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Abstract : This dissertation is a contribution to the knowledge of the computational complexity of discrete combinatorial problems. 1. The first problem that we consider is to compute the maximum independent set of a box graph, that is, given a set of orthogonal boxes in the plane compute the largest subset such that no boxes in the subset overlap. READ MORE
-
20. Constraint Programming Methods for Optimization of Single Shortest Path Routing
Abstract : In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem. The problem is to find optimal values for a set of routing configuration parameters in a shortest path routing protocol, for a given network. READ MORE