Search for dissertations about: "sort algorithm"
Showing result 1 - 5 of 15 swedish dissertations containing the words sort algorithm.
-
1. On adaptive sorting in sequential and parallel models
Abstract : Sorting is probably the most well-studied problem in computer science. In many applications the elements to be sorted are not randomly distributed, but are already nearly ordered. Most existing algorithms do not take advantage of this fact. READ MORE
-
2. Development and applications of theoretical algorithms for simulations of materials at extreme conditions
Abstract : Materials at extreme conditions exhibit properties that differ substantially from ambient conditions. High pressure and high temperature expose anharmonic, non-linear behavior, and can provoke phase transitions among other effects. Experimental setups to study that sort of effects are typically costly and experiments themselves are laborious. READ MORE
-
3. Robot Manipulation Planning Among Obstacles: Grasping, Placing and Rearranging
Abstract : This thesis presents planning algorithms for three different robot manipulation tasks: fingertip grasping, object placing and rearranging. Herein, we place special attention on addressing these tasks in the presence of obstacles. READ MORE
-
4. Constructive Methods for SAGBI and SAGBI-Gröbner Bases
Abstract : The thesis consists of an introduction and the following four papers: Paper I: Using resultants for SAGBI basis verification in the univariate polynomial ring. Authors: Anna Torstensson, Victor Ufnarovski and Hans Öfverbeck. READ MORE
-
5. Combinatorics of genome rearrangements and phylogeny
Abstract : This thesis deals with combinatorial problems taken frombioinformatics. In particular, we study the problem ofinferring distances between bacterial species by looking attheir respective gene orders. We regard one of the gene ordersas a permutation of the other. READ MORE