Sökning: "Erik Nordlöf"

Hittade 2 uppsatser innehållade orden Erik Nordlöf.

1. 1. Discrete Flower Pollination Algorithm for the Graph Coloring Problem

   Kandidat-uppsats, KTH/Datavetenskap

   Författare :Samuel Falk; Erik Nordlöf; [2022]
   Nyckelord :;

   Sammanfattning : The graph coloring problem (GCP) is a famous NP-hard problem applicable to many real-world problems. The Flower Pollination Algorithm (FPA) is a relatively recently developed algorithm based on the pollination-behaviors of flowers. It has seen great results in single- and multi-objective optimization in continuous search spaces. LÄS MER

3. 2. Multiposionskontroll för generiska mikroskop

   M1-uppsats, KTH/Tillämpad maskinteknik (KTH Södertälje)

   Författare :Kim Nordlöf; Erik Vernersson; [2012]
   Nyckelord :;

   Sammanfattning : .... LÄS MER