Sökning: "NP-Hard"

Visar resultat 1 - 5 av 64 uppsatser innehållade ordet NP-Hard.

  1. 1. Assembly Line Balancing : Addressing the Theory-Practice Gap

    Uppsats för yrkesexamina på avancerad nivå, Luleå tekniska universitet/Institutionen för system- och rymdteknik

    Författare :Christoffer Fink; [2023]
    Nyckelord :assembly line balancing; ALB; OptaPlanner;

    Sammanfattning : The efficiency of an assembly line depends on how the different tasks are distributed among the work stations that make up the assembly line. Assigning the tasks to the stations is called assembly line balancing (ALB) and is an NP-hard optimization problem. LÄS MER

  3. 2. Design and Analysis of Non-symmetric Satellite Constellations

    Master-uppsats, KTH/Lättkonstruktioner, marina system, flyg- och rymdteknik, rörelsemekanik

    Författare :Jomuel Danilo Costales; [2023]
    Nyckelord :Space; Satellite; Constellation; Coverage; Non-symmetric; Walker; Set Cover problem; Greedy algorithm; Space; Satellit; Constellation; Täckning; Icke-symmetrisk; Walker; Set Cover problem; Greedy algoritm;

    Sammanfattning : Satellite constellation design has been a well-studied problem since the beginning of the space age. In recent years new concepts and approaches tried to solve it with fewer satellites whilst guaranteeing coverage to the areas of interest, whether globally or regionally. LÄS MER

  4. 3. Analysis of Flow Prolongation Using Graph Neural Network in FIFO Multiplexing System

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

    Författare :Weiran Wang; [2023]
    Nyckelord :Network Calculus; Flow Prolongation; Graph Neural Network; Fast Gradient Sign Method; Delay Bound; Nätverkskalkyl; Flödesförlängning; Graph Neural Network; Fast Gradient Sign Method; Fördröjningsgräns;

    Sammanfattning : Network Calculus views a network system as a queuing framework and provides a series of mathematical functions for finding an upper bound of an end-to-end delay. It is crucial for the design of networks and applications with a hard delay guarantee, such as the emerging Time Sensitive Network. LÄS MER

  5. 4. The Applicability and Scalability of Graph Neural Networks on Combinatorial Optimization

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Peder Hårderup; [2023]
    Nyckelord :applied mathematics; combinatorial optimization; machine learning; graph neural networks; scalability; tillämpad matematik; kombinatorisk optimering; maskininlärning; grafiska neurala nätverk; skalbarhet;

    Sammanfattning : This master's thesis investigates the application of Graph Neural Networks (GNNs) to address scalability challenges in combinatorial optimization, with a primary focus on the minimum Total Dominating set Problem (TDP) and additionally the related Carrier Scheduling Problem (CSP) in networks of Internet of Things. The research identifies the NP-hard nature of these problems as a fundamental challenge and addresses how to improve predictions on input graphs of sizes much larger than seen during training phase. LÄS MER

  7. 5. Implementation and evaluation of TSN scheduling algorithms

    Kandidat-uppsats, Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)

    Författare :Emanuel Svensson; [2023]
    Nyckelord :time-sensitive networking; real-time applications; time-sensitive networks;

    Sammanfattning : Time Sensitive Networking (TSN) is a standard that extends Ethernet, providing deterministic guarantees to internal communications. The standard is finding use in many different fields such as modern cars whose networks are getting increasingly complex. LÄS MER