Sökning: "Exchange algorithm"

Visar resultat 1 - 5 av 59 avhandlingar innehållade orden Exchange algorithm.

  1. 1. Achievement tests and optimal design for pretesting of questions

    Författare :Mahmood Ul Hassan; Frank Miller; Steven Gilmour; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Achievement test; Equivalence theorem; Exchange algorithm; Item calibration; Item response theory model; Optimal experimental design; Statistics; statistik;

    Sammanfattning : 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. LÄS MER

  3. 2. Baseband Processing for 5G and Beyond: Algorithms, VLSI Architectures, and Co-design

    Författare :Mojtaba Mahdavi; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; VLSI Implementation; Hardware architectures; ASIC implementation; FPGA implementation; CMOS Technology; Baseband Processing; Massive MIMO; 5G New Radio; Beyond 5G; Co-Design; FFT processor; OFDM modulation; wireless communications; Massive MIMO Detection; Angular domain processing; Zero forcing; Systolic array; Non-linear detector; Channel Sparsity; Channel compression; Linear detector; Channel coding; Spatial coupling; Turbo-like codes; Spatially coupled serially concatenated codes; Threshold analysis; Decoder architecture; BCJR algorithm; MAP algorithm; Coupling memory; Window decoding; Complexity analysis; Performance Evaluation; Throughput; Decoding Latency; Silicon area; Design tradeoffs; Interleaver architecture; Memory requirements; Matrix multiplication; Channel state information CSI ; Cholesky decomposition; Tanner graph; Trellis codes; Convolutional encoder; Code design; Puncturing; Reordering circuit; wireless communication system; digital electronic;

    Sammanfattning : 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. LÄS MER

  4. 3. Distributed Optimization and Control : Primal--Dual, Online, and Event-Triggered Algorithms

    Författare :Xinlei Yi; Karl H. Johansson; Dimos V. Dimarogonas; John S. Baras; Antonis Papachristodoulou; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Distributed nonconvex optimization; distributed online convex optimization; distributed event-triggered control; primal-dual algorithm; stochastic gradient descent; zeroth-order algorithm; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : 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. LÄS MER

  5. 4. Unsupervised Learning of Morphology: Survey, Model, Algorithm and Experiments

    Författare :Harald Hammarström; Göteborgs universitet; []
    Nyckelord :HUMANIORA; HUMANITIES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : 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. LÄS MER

  7. 5. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem

    Författare :Raad Salman; Göteborgs universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; PCGmTSP; GTSP; SOP; mTSP; branch and bound; asymmetric generalized multiple traveling salesman problem; VRP; PCGTSP; dynamic programming; sequential ordering problem; vehicle routing problem; ant colony optimization; metaheuristic local search heuristic; precedence constraints; edge exchange; ant colony optimization;

    Sammanfattning : 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. LÄS MER