Sökning: "Breadth-first Search"

Visar resultat 6 - 10 av 12 uppsatser innehållade orden Breadth-first Search.

1. 6. Pathfinder : Autonomous Guided Vehicle using Infrared Light

   Kandidat-uppsats, KTH/Maskinkonstruktion (Inst.)

   Författare :Oskar Nordström; Alexander Axelsson; [2018]
   Nyckelord :Mechatronics; Software architecture; Autonomous guided vehicle; Breadth-first Search; Mekatronik; Mjukvaruarkitektur; Autonomt styrt fordon; Bredden-först-sökning;

   Sammanfattning : I världen växer forskning på självgående fordon dagligen.Målet med detta projekt var att skapa ett självgåendefordon och utforska möjligheterna att använda infrarödareflektioner som navigeringsmetod och hur man kanuppnå distinkta mätvärden. Avhandlingen diskuterar ävenmöjligheterna att använda flera prototyper i en störreskala. LÄS MER

3. 7. Implementing and Evaluating a Breadth-First Search in Cypher

   Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för datavetenskap

   Författare :Alexander Olsson; Therese Magnusson; [2018]
   Nyckelord :Breadth-First Search; Graph Database; Neo4j; Cypher; Master’s Thesis; Technology and Engineering;

   Sammanfattning : This report covers the implementation and evaluation of a Breadth-First Search operand for the Neo4j graph database and the Cypher query language. The evaluation compared the pre-existing Depth-First Search operand with both a non-optimized and two different optimized Breadth-First Searches. LÄS MER

4. 8. F# and Go compared to Java : A breadth-first search and survey comparison of F# and Go vs Java

   Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

   Författare :Johan Lindeberg; Marcus Åberg; [2015]
   Nyckelord :;

   Sammanfattning : This report follows the Bachelor exam specifications of the 6 credit version of the DD143X courseat the Royal Institute of Technology from 2012 and was revised and restructured by JohanLindeberg in April 2015. In this report we have explored the two up and coming languages Goand F# and made comparisons to the already established language Java. LÄS MER

5. 9. CluStic – Automatic graph drawing with clusters

   Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

   Författare :Villiam Aspegren; [2015]
   Nyckelord :Graph drawing; Automatic graph layout; Directed graphs; Sugiyama; Cluster; Clusters;

   Sammanfattning : Finding a visually pleasing layout from a set of vertices and edges is the goal of automatic graph drawing. A requirement that has been barely explored however, is that users would like to specify portions of their layouts that are not altered by such algorithms. LÄS MER

7. 10. Tetris: A Heuristic Study : Using height-based weighing functions and breadth-first search heuristics for playing Tetris

   Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

   Författare :Max Bergmark; [2015]
   Nyckelord :;

   Sammanfattning : This paper studies the performance of height-based weighing functions and compares the results to using the commonly used non height-based weighing functions for holes. For every test performed, the heuristic methods studied in this paper performed better than the commonly used heuristic function. LÄS MER