Search for dissertations about: "Exchange algorithm"
Showing result 1 - 5 of 59 swedish dissertations containing the words Exchange algorithm.
-
1. Achievement tests and optimal design for pretesting of questions
Abstract : Achievement tests are used to measure the students' proficiency in a particular knowledge. Computerized achievement tests (e.g. GRE and SAT) are usually based on questions available in an item bank to measure the proficiency of students. READ MORE
-
2. Baseband Processing for 5G and Beyond: Algorithms, VLSI Architectures, and Co-design
Abstract : In recent years the number of connected devices and the demand for high data-rates have been significantly increased. This enormous growth is more pronounced by the introduction of the Internet of things (IoT) in which several devices are interconnected to exchange data for various applications like smart homes and smart cities. READ MORE
-
3. Distributed Optimization and Control : Primal--Dual, Online, and Event-Triggered Algorithms
Abstract : In distributed optimization and control, each network node performs local computation based on its own information and information received from its neighbors through a communication network to achieve a global objective. Although many distributed optimization and control algorithms have been proposed, core theoretical problems with important practical relevance remain. READ MORE
-
4. Unsupervised Learning of Morphology: Survey, Model, Algorithm and Experiments
Abstract : This thesis contains work on a specific problem in field of Language Technology. The problem can be described as follows: "Can a computer extract a description of word conjugation in a natural language using only written text in the language?" The problem is often referred to as Unsupervised Learning of Morphology (ULM) and has a wide variety of Language Technology applications, including Machine Translation, Document Categorization and I nformation Retrieval. READ MORE
-
5. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem
Abstract : In the planning phases of automated manufacturing, generating efficient programs for robot stations is a crucial problem which needs to be solved. One aspect of the programming is the optimization of task sequences, such as series of welds or measuring points, so that the cycle time is minimized. READ MORE