Sökning: "minimum spanning tree"

Visar resultat 1 - 5 av 8 uppsatser innehållade orden minimum spanning tree.

  1. 1. Parallel Minimum Cuts : An improved CREW PRAM algorithm

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Andrés López Martínez; [2020]
    Nyckelord :;

    Sammanfattning : This thesis considers the minimum cut problem in undirected, weighted graphs. We present a simple randomized CREW PRAM algorithm to find the minimum cut in a graph G with n nodes and m edges, based on Karger’s celebrated randomized near-linear time min-cut algorithm [STOC’96]. LÄS MER

  3. 2. A Technology Agnostic Approach for Standard-cell Layout Design Automation

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Tom Johansson; [2019]
    Nyckelord :IC; automation; standard cell; standard cell design; ASIC; chip; graph theory; SAT; full adder; adder; MUX; layout; schematic; mst; minimum spanning tree; kruskal; pnr; placement; routing; Technology and Engineering;

    Sammanfattning : The logic scaling following Moores law has reached a level where System on Chips (SoCs) commonly contains millions of standard cells. The sheer amount implies that even small optimizations on a standard cell can have a significant effect on the SoC performance. To ensure the performance of standard cells, many of these are hand-drawn. LÄS MER

  4. 3. A Platform for Indoor Localisation, Mapping, and Data Collection using an Autonomous Vehicle

    Master-uppsats, Lunds universitet/Matematik LTH

    Författare :Teodor Coroiu; Oscar Hinton; [2017]
    Nyckelord :Area Coverage; Autonomous Vehicles; Exploration; Robotic Operating System; ROS; SLAM; Simultaneous Localisation And Mapping; Wi-Fi; Mathematics and Statistics;

    Sammanfattning : Everyone who has worked with research knows how rewarding experimenting and developing new algorithms can be. However in some cases, the hard part is not the invention of these algorithms, but their evaluation. LÄS MER

  5. 4. Network optimisation and topology control of Free Space Optics

    Master-uppsats, Linköpings universitet/Kommunikations- och transportsystem; Linköpings universitet/Tekniska högskolan

    Författare :Tobias Nordkvist; [2016]
    Nyckelord :Free-space optics; Network optimization; Routing; Network survivability;

    Sammanfattning : In communication networks today, the amount of users and traffic is constantly increasing. This results in the need for upgrading the networks to handle the demand. Free space optics, FSO, is a technique which is relatively cheap with high capacity compared to most systems today. LÄS MER

  7. 5. Network optimisation and topology control of Free Space Optics

    Master-uppsats, Linköpings universitet/Kommunikations- och transportsystem; Linköpings universitet/Tekniska högskolan

    Författare :Emil Hammarström; [2015]
    Nyckelord :Free-space optics; Network optimization; Routing; Network survivability;

    Sammanfattning : In communication networks today, the amount of users and traffic is constantly increasing. This results in the need for upgrading the networks to handle the demand. Free space optics is a technique which is relatively cheap with high capacity compared to most systems today. LÄS MER