Essays about: "graph distance"
Showing result 1 - 5 of 35 essays containing the words graph distance.
-
1. Station-level demand prediction in bike-sharing systems through machine learning and deep learning methods
University essay from Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskapAbstract : Public Bike-Sharing systems have been employed in many cities around the globe. Shared bikes are an efficient and convenient means of transportation in advanced societies. Nonetheless, station planning and local bike-sharing network effectiveness can be challenging. READ MORE
-
2. Designing a Novel RPL Objective Function & Testing RPL Objective Functions Performance
University essay from Linnéuniversitetet/Institutionen för datavetenskap och medieteknik (DM)Abstract : The use of Internet of Things systems has increased to meet the need for smart systems in various fields, such as smart homes, intelligent industries, medical systems, agriculture, and the military. IoT networks are expanding daily to include hundreds and thousands of IoT devices, which transmit information through other linked devices to reach the network sink or gateway. READ MORE
-
3. Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Graphs are powerful data structures that are widely used to represent complex forms of information. One area in which graphs are successfully being used is within compiler engineering, where a program under compilation can be represented as a graph that changes as the program is being compiled. READ MORE
-
4. Distance Consistent Labellings and the Local List Number
University essay from Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakultetenAbstract : We study the local list number of graphs introduced by Lennerstad and Eriksson. A labelling of a graph on n vertices is a bijection from vertex set to the set {1,…, n}. Given such a labelling c a vertex u is distance consistent if for all vertices v and w |c(u)-c(v)|=|c(u)-c(w)|+1 implies d(u,w)≤ d(u,v). READ MORE
-
5. Visualizing Animal Activity using Intelligent Tags
University essay from Linköpings universitet/Institutionen för systemteknikAbstract : Supervising animals is a significant task in many contexts, for example the keep-ing of cattle and protection of endangered species in sanctuaries, like the blackrhino. Digital solutions exist but can be improved further to ease the workflowof the supervision. READ MORE