Essays about: "Timing algorithm"

Showing result 6 - 10 of 44 essays containing the words Timing algorithm.

  1. 6. Exploring Column Update Elimination Optimization for Spike-Timing-Dependent Plasticity Learning Rule

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

    Author : Ojasvi Singh; [2022]
    Keywords : Spike-Timing Dependent Plasticity; neuromorphic computing; Hebbian Learning; Spiking Neural Networks; memory optimization.; Spike-Timing Beroende Plasticitet; neuromorfisk beräkning; Hebbiansk inlärning; Spiking Neural Networks; Minnes optimering;

    Abstract : Hebbian learning based neural network learning rules when implemented on hardware, store their synaptic weights in the form of a two-dimensional matrix. The storage of synaptic weights demands large memory bandwidth and storage. READ MORE

  3. 7. Fair Partitioning of Procedurally Generated Game Maps for Grand Strategy Games

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : Jens Ottander; [2022]
    Keywords : Procedural map generation; Constrained optimization; Categorical optimization; Multiobjective optimization; Genetic algorithms; NSGA-III; MOEA D-IEpsilon; Grand Strategy Games; Partitioning; Multiplayer Games;

    Abstract : Due to the high cost of manual content creation within the game development industry, methods for procedural generation of content such as game maps and levels have emerged. However, methods for generating game maps have remained relatively unexplored in competitive multiplayer contexts. READ MORE

  4. 8. Design space exploration using HLS in relation to code structuring

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

    Author : Debraj Das; [2022]
    Keywords : Design Space Exploration DSE ; High level Synthesis HLS ; Design Methodology;

    Abstract : High Level Synthesis (HLS) is a methodology to translate a model developed in a high abstraction layer, e.g. C/C++/SystemC, that describes the algorithm into a Register-Transfer level (RTL) description like Verilog or VHDL. READ MORE

  5. 9. Linux CPU Schedulers: CFS and MuQSS Comparison

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : David Shakoori Gustafsson; [2021]
    Keywords : ;

    Abstract : The goal of this thesis is to compare two process schedulers for the Linux operating system. In order to provide a responsive and interactive user experience, an efficient process scheduling algorithm is important. This thesis seeks to explain the potential performance differences by analysing the schedulers' respective designs. READ MORE

  6. 10. MINIMIZING INTER-CORE DATA-PROPAGATION DELAYS IN PARTITIONED MULTI-CORE REAL-TIME SYSTEMS USING SCHEDULING HEURISTICS

    University essay from Mälardalens högskola/Akademin för innovation, design och teknik

    Author : Emil Åberg; [2021]
    Keywords : Embedded Systems Scheduling Heuristic Multi-Core;

    Abstract : In the field of embedded systems, computers embedded into machines ranging from microwaveovensto assembly lines impact the physical world. They do so under tight real-time constraintswith ever-increasing demand for computing power and performance. READ MORE