Essays about: "bounds"
Showing result 11 - 15 of 224 essays containing the word bounds.
-
11. Tensor rank and support rank in the context of algebraic complexity theory
University essay from KTH/Matematik (Avd.)Abstract : Starting with the work of Volker Strassen, algorithms for matrix multiplication have been developed which are time complexity-wise more efficient than the standard algorithm from the definition of multiplication. The general method of the developments has been viewing the bilinear mapping that matrix multiplication is as a three-dimensional tensor, where there is an exact correspondence between time complexity of the multiplication algorithm and tensor rank. READ MORE
-
12. Latency Bounds for Memory-Based FFTs with Applications in OFDM Communication
University essay from Linköpings universitet/Institutionen för systemteknikAbstract : Future communication systems require low latency Fast Fourier transform (FFT)computation with a small cost of area. In this study, a memory-based FFT processorwith low latency is designed. READ MORE
-
13. Scalable Reinforcement Learning for Formation Control with Collision Avoidance : Localized policy gradient algorithm with continuous state and action space
University essay from KTH/Skolan för teknikvetenskap (SCI); KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In the last decades, significant theoretical advances have been made on the field of distributed mulit-agent control theory. One of the most common systems that can be modelled as multi-agent systems are the so called formation control problems, in which a network of mobile agents is controlled to move towards a desired final formation. READ MORE
-
14. Random Edge is not faster than Random Facet on Linear Programs
University essay from KTH/Matematik (Avd.)Abstract : A Linear Program is a problem where the goal is to maximize a linear function subject to a set of linear inequalities. Geometrically, this can be rephrased as finding the highest point on a polyhedron. The Simplex method is a commonly used algorithm to solve Linear Programs. READ MORE
-
15. Expression Simplification Using E-Graphs for Interval Evaluation
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Daisy is a framework for verifying and bounding the magnitudes of rounding errors introduced by floating-point arithmetic in numerical programs. As part of this, Daisy employs a rudimentary algorithm for simplifying expressions derived from the programs. READ MORE