Essays about: "graph"
Showing result 1 - 5 of 875 essays containing the word graph.
-
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. Identifying Graph Characteristics in Growing Vascular Networks
University essay from Uppsala universitet/Tillämpad beräkningsvetenskapAbstract : One of the ways that a vascular network grows is through the process of angiogenesis, wherebya new blood vessel forms as a branch from an existing vessel towards an area which isstimulating vascular growth. Due to the demands for nutrients and waste transport, growingtumour cells will access the surrounding vascular network by inducing angiogenesis. READ MORE
-
3. Adaptive Tactics in Software Operations: How People Manage Complexity by Asking for Help
University essay from Lunds universitet/Avdelningen för Riskhantering och SamhällssäkerhetAbstract : Society relies on the continued operation of software systems, from healthcare to social media platforms. These systems can be engineered to be highly reliable, but complexity assures surprise. People have the ability to manage this complexity, filling gaps in design by recognizing, diagnosing and correcting anomalies. READ MORE
-
4. Cache replacement policies and their impact on graph database operations
University essay from Lunds universitet/Institutionen för datavetenskapAbstract : .... READ MORE
-
5. Applications of Random Walks : How Random Walks Are Used in Wilson's Algorithm and How They Connect to Electrical Networks
University essay from Uppsala universitet/Sannolikhetsteori och kombinatorikAbstract : In this master thesis we will show how random walks are used in Wilson's algorithm to generate spanning trees of graphs, and how they can be used to calculate the number of spanning trees in a graph. We will also explore the connection between electrical networks and random walks, and how this connection can be exploited to prove Pólya's theorem (normally proved with probability and combinatorics) using electrical arguments. READ MORE