Essays about: "heuristic algorithm"

Showing result 11 - 15 of 127 essays containing the words heuristic algorithm.

  1. 11. Implementation of an Irregular Packaging Algorithm for Multi-Container

    University essay from Uppsala universitet/Industriell teknik

    Author : Azad Fakhir Salih; [2023]
    Keywords : irregular packaging problem; genetic algorithm; bottom-left placement; polygon-based geometric representation; proximity-based strategies;

    Abstract : This study introduces an innovative approach to address a complex, real-world packing problem experienced at Emerson Rosemount Tank Radar. The objectives of the study are manifold: primarily, the optimization of packing efficiency within specified geometric and box constraints, and secondarily, the fulfillment of specific packing objectives. READ MORE

  2. 12. Edge Compute Offloading Strategies using Heuristic and Reinforcement Learning Techniques.

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Chrysoula Dikonimaki; [2023]
    Keywords : Computation offloading; Edge Computing; Heuristics; Multi-armed bandit; Beräkningsavlastning; Heuristics; Kantberäkning; Flerarmad bandit-algoritm;

    Abstract : The emergence of 5G alongside the distributed computing paradigm called Edge computing has prompted a tremendous change in the industry through the opportunity for reducing network latency and energy consumption and providing scalability. Edge computing extends the capabilities of users’ resource-constrained devices by placing data centers at the edge of the network. READ MORE

  3. 13. Reinforcement learning for improved local search : Applied to the graph coloring problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Adrian Salamon; Klara Sandström; [2023]
    Keywords : ;

    Abstract : The graph coloring problem (GCP) is an important combinatorial optimization problem (COP) with various applications and a simple formulation: to assign colors to vertices in a graph such that no adjacent vertices share a color. The GCP is NP-hard, and in order to solve it within a reasonable time frame, heuristic local search (LS) based algorithms are commonly used. READ MORE

  4. 14. Most efficient Inverse Kinematics algorithm for Quadruped models : Comparing FABRIK to CCD

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Matilda Richardsson; [2022]
    Keywords : Inverse Kinematics; FABRIK; CCD; Quadrupeds; Computer Graphics;

    Abstract : This paper compares the two heuristic inverse kinematics methods: Forward And Backward Reaching Inverse Kinematics (FABRIK) and Cyclic Coordinate Descent (CCD) in the use cases concerning quadruped models. Unoptimised versions of the two algorithms were implemented into a game engine and evaluated on a quadruped model. READ MORE

  5. 15. A heuristic approach to screw pose detection

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Emil Ransed; [2022]
    Keywords : ;

    Abstract : Object detection using vision systems could generally be accomplished using machine learning or conventional computer vision techniques. This thesis implements and compares three methods to locate screws on a flat plane using conventional computer vision on regular non stereo images without any depth or range information. READ MORE