Essays about: "longest path"

Showing result 1 - 5 of 8 essays containing the words longest path.

1. 1. Constructing and representing a knowledge graph(KG) for Positive Energy Districts (PEDs)

   University essay from Högskolan Dalarna/Institutionen för information och teknik

   Author : Mahtab Davari; [2023]
   Keywords : Knowledge graph; Positive Energy Districts PEDs ; longest path; Questions and Answers; Community Detection; Node Embedding; t-SNE plots; Edge Prediction;

   Abstract : In recent years, knowledge graphs(KGs) have become essential tools for visualizing concepts and retrieving contextual information. However, constructing KGs for new and specialized domains like Positive Energy Districts (PEDs) presents unique challenges, particularly when dealing with unstructured texts and ambiguous concepts from academic articles. READ MORE

3. 2. Using Search to Improve Visual Understanding and Appreciation of Process Model Diagrams

   University essay from Umeå universitet/Institutionen för datavetenskap

   Author : Daniel Vandolph; [2020]
   Keywords : ;

   Abstract : This thesis focuses on comparing four different layouts of the same process model diagram in terms of user understanding and appreciation. When the model diagram is aligned around the shortest path from start to goal, it represents the version of a process where everything goes as planned. READ MORE

4. 3. Evaluation of the Complexity of Procedurally Generated Maze Algorithms

   University essay from Blekinge Tekniska Högskola/Institutionen för kreativa teknologier

   Author : Albin Karlsson; [2018]
   Keywords : PCG; Mazes; Labyrinth; Recursive Backtracker; Recursive Division; Prims Algorithm; Randomized Prims Algorithm; Depth-first-search; Game;

   Abstract : Background. Procedural Content Generation (PCG) in Video Games can be used as a tool for efficiently producing large varieties of new content using less manpower, making it ideal for smaller teams of developers who wants to compete with games made by larger teams. One particular facet of PCG is the generation of mazes. READ MORE

5. 4. A comparison of differential evolution and a genetic algorithm applied to the longest path problem

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Marcus Hamilton; Jacob Nyman; [2018]
   Keywords : ;

   Abstract : Genetic algorithms and differential evolution are two well-established types of generic algorithms that can be applied to a great numberof optimization problems. Both are subgroups of evolutionary algorithms that are inspired by nature, with many practical implementations in for instance research and the industry. READ MORE

6. 5. CluStic – Automatic graph drawing with clusters

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

   Author : Villiam Aspegren; [2015]
   Keywords : Graph drawing; Automatic graph layout; Directed graphs; Sugiyama; Cluster; Clusters;

   Abstract : 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. READ MORE