Essays about: "dijkstra"

Showing result 16 - 20 of 28 essays containing the word dijkstra.

  1. 16. Comparative Analysis of Weighted Pathfinding in Realistic Environments

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Richard Uggelberg; Andreas Lundblom; [2017]
    Keywords : ;

    Abstract : The general subject of this thesis concerns different weightings applied to Dijkstra’s pathfinding algorithm to balance performance versus accuracy in a simulated realistic environment. The algorithms used in this study are Dijkstra's pathfinding algorithm and A*. READ MORE

  3. 17. Experimental Evaluation of GPU Solutions to the Single Source Shortest Path Problem

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Dan Hemgren; Ernst Widerberg; [2017]
    Keywords : ;

    Abstract : Originally designed for computer graphics, the modern graphics processing unit (GPU) has now become a potential powerhouse for parallel calculations through the use of platforms such as CUDA and OpenCL. This paper presents an experimental evaluation of GPU- and CPU-parallel as well as CPU-sequential implementations for solving the single source shortest path problem. READ MORE

  4. 18. Approximating multi-commodity max-flow in practice

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Kristoffer Emanuelsson; [2016]
    Keywords : multi-commodity; maximum flow; max flow; flow; multicommodity; approximation; schemes; framework; dynamic graph; dynamic; ES-tree; complexity; space; time; Madry; multicommodity; maximum flöde; max flöde; flöde; approximering; framework; dynamiska grafer; graf; dynamiskgraf; ES-träd; tidskomplexitet; komplexitet; minneskomplexitet; Madry;

    Abstract : Garg and Könemann developed a framework for computing multi-commodity maximum flow in a graph, later called a multiplicative weight update framework. Madry used this framework and exchanged Dijkstra’s algorithm to a dynamic graph algorithm for approximating the shortest paths through the graph. READ MORE

  5. 19. Pathfinding and positioning in a labyrinth game using a wide-angle camera

    University essay from Lunds universitet/Institutionen för reglerteknik

    Author : Stefan Olsson; [2015]
    Keywords : Technology and Engineering;

    Abstract : Alten AB has a technology demonstator in the form of a motorized and camera equipped large scale labyrinth game. The ball position is controlled by a ABB industrial PLC connected with Android tablets for user interface and a camera as a sensor for the ball position. READ MORE

  6. 20. Compressing sparse graphs to speed up Dijkstra’s shortest path algorithm

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Johan Bergdorf; Jesper Norman; [2015]
    Keywords : ;

    Abstract : One of the problems that arises from the continuously growing amount of data is that it slows down and limits the uses of large graphs in real world situations. Because of this, studies are being done to investigate the possibility of compressing data in large graphs. READ MORE