Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 44 for “"Min-Sum"”.

  1. Προσεγγιστικοί αλγόριθμοι για το Generalized Min-Sum Set Cover

    … προγραμματισμό, για το πρόβλημα Generalized Min-Sum Set Cover ή Multiple Intents Re-Ranking, Σε αυτό το NP-hard πρόβλημα, μας δίνεται μια συλλογή από σύνολα. Το κάθε σύνολο S έχει μια απαραίτητη προϋπόθεση κάλυψης K(S). Στόχος είναι να διατάξουμε τα στοιχεία των συνόλων σε τέτοια σειρά ώστε ο …

    athens Repository record for Προσεγγιστικοί αλγόριθμοι για το Generalized Min-Sum Set Cover (opens in a new tab)

  2. Using min-sum loopy belief propagation for decentralised supply chain formation

    … levels of flexibility and responsiveness to consumer demand, and require the ability to quickly and efficiently select trading partners. Automated computational techniques for supply chain formation have the potential to provide significant advantages in terms of speed and efficiency over the …

    aston Download PDF for Using min-sum loopy belief propagation for decentralised supply chain formation (opens in a new tab)

  3. On The Analysis of Spatially-Coupled GLDPC Codes and The Weighted Min-Sum Algorithm

    … codes is introduced. The main result is that the minimal redundancy allowed by Shannon’s Channel Coding Theorem can be achieved by using the new iterative HDD algorithm with spatially-coupled GLDPC codes. A variety of low-density parity-check (LDPC) ensembles have now been observed to approach …

    tamu Repository record for On The Analysis of Spatially-Coupled GLDPC Codes and The Weighted Min-Sum Algorithm (opens in a new tab)

  4. Design and implementation of decoders for error correction in high-speed communication systems

    … and hard-decision decoding algorithms (such as Min-Sum, Optimized 2-bit Min-Sum and Reliability-based iterative Majority-Logic) are analyzed. The complexity and performance of those algorithms are improved to allow efficient hardware architectures. A new decoding algorithm called One-Minimum …

    upv Repository record for Design and implementation of decoders for error correction in high-speed communication systems (opens in a new tab)

  5. Diseño de decodificadores de altas prestaciones para código LDPC

    … las prestaciones de los algoritmos existentes Sum-product, Min-Sum y las principales variantes de este último (Min-Sum con escalado y Min-Sum con offset). Además, se ha realizado un análisis de precisión finita utilizando los códigos LDPC de los estándares IEEE 802.3an, IEEE 802.11n e IEEE …

    upv Repository record for Diseño de decodificadores de altas prestaciones para código LDPC (opens in a new tab)

  6. Machine learning based congestion control in wireless sensor networks

    … second solution is an inference technique called Min-Sum. The minimization of congestion is transformed into smaller coordination problems involving fewer variables.The simulation results show that 15% improvement in energy efficiency is obtained over the recently proposed Fusion method. Although …

    nus Repository record for Machine learning based congestion control in wireless sensor networks (opens in a new tab) Download file for Machine learning based congestion control in wireless sensor networks (opens in a new tab)

  7. Design of structured nonbinary quasi-cyclic low-density parity-check codes

    … of nonbinary LDPC codes. The algorithms include sum-product (SP) algorithm, SP algorithm using fast Fourier transform, min-sum (MS) algorithm and complexity reduced extended min-sum (EMS) algorithm. In particular, we present the proposed modified min-sum algorithm with threshold filtering which …

    unsw Repository record for Design of structured nonbinary quasi-cyclic low-density parity-check codes (opens in a new tab)

  8. Finite tree-based decoding of low-density parity-check codes

    … iterative message-passing decoders, such as the min-sum and sum-product decoders. Computer simulations demonstrate that these suboptimal decoders are capable of achieving low probability of bit error at signal-to-noise ratios close to capacity. However, current methods for analyzing the behavior …

    nebraska Repository record for Finite tree-based decoding of low-density parity-check codes (opens in a new tab)

  9. Iterative decoding in analog VLSI

    … for implementing affordable high-speed analog min-sum iterative decoders by using strongly inverted CMOS transistors. This is favorable because previously reported analog decoders were either BiCMOS or weakly inverted CMOS designs. The former could be fast but is rather expensive and the latter …

    carleton Repository record for Iterative decoding in analog VLSI (opens in a new tab)

  10. Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results

    … that the total distance traveled by the fleet is minimized. In this dissertation, we study variants of the VRP that minimize the completion time, i.e., we minimize the distance of the longest route. We call it the min-max objective function. In applications such as disaster relief efforts and …

    maryland Repository record for Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results (opens in a new tab)

  11. Efficient cycle algorithms for capacitated optical network design

    … networks. We first present the MSCC (Min-Sum Cycle Cover) Algorithm for simultaneous detection and protection using the Eulerian graph theory, and then analyze the performance of the algorithm through making comparison of it with other algorithms. By extending the features of algorithm …

    ottawa-retro Repository record for Efficient cycle algorithms for capacitated optical network design (opens in a new tab)

  12. MULTI-VEHICLE ROUTE PLANNING FOR CENTRALIZED AND DECENTRALIZED SYSTEMS

    … route planning is the problem of determining routes for a set of vehicles to visit a set of locations of interest. In this thesis, we describe a study of a classical multi-vehicle route planning problem which compared existing solutions methods on min-sum (minimizing total distance …

    maryland Repository record for MULTI-VEHICLE ROUTE PLANNING FOR CENTRALIZED AND DECENTRALIZED SYSTEMS (opens in a new tab)

  13. Restoring Consistency in Ontological Multidimensional Data Models via Weighted Repairs

    … weight generation we present a dynamic programming based Min-Sum algorithm to identify minimal weight solution. We then apply evolutionary optimization techniques and demonstrate improved performance using medical datasets, making it realizable in practice.

    mcmaster Repository record for Restoring Consistency in Ontological Multidimensional Data Models via Weighted Repairs (opens in a new tab)

  14. DEEP REINFORCEMENT LEARNING FOR SOLVING VEHICLE ROUTING PROBLEMS

    … proposed to construct routes for HVRP with both min-max and min-sum objectives by iteratively selecting first a vehicle and then a node. Secondly, a neural construction method integrated with a novel heterogeneous attention mechanism is developed for PDTSP by iteratively selecting a pickup node …

    nus Repository record for DEEP REINFORCEMENT LEARNING FOR SOLVING VEHICLE ROUTING PROBLEMS (opens in a new tab) Download file for DEEP REINFORCEMENT LEARNING FOR SOLVING VEHICLE ROUTING PROBLEMS (opens in a new tab)

  15. Semi-parallel architectures for real-time LDPC coding

    … Parity Check (LDPC) codes. A modified version of Min-Sum algorithm has been used for the decoder, which has the advantage of simpler computations compared to Sum-Product algorithm without any loss in performance. To balance the area time trade-off of the design, a special structure is proposed for …

    rice Repository record for Semi-parallel architectures for real-time LDPC coding (opens in a new tab)

  16. A Study on Quantization and Hardware Cost Tradeoffs in a 5G NR LDPC Decoder on FPGA

    … check node message width WR, and the normalized min-sum correction factor α. This thesis characterizes how these three parameters affect both error correction performance and FPGA resource utilization for an LDPC decoder on an established LDPC decoder architecture. A bit-accurate MATLAB core …

    calpoly Repository record for A Study on Quantization and Hardware Cost Tradeoffs in a 5G NR LDPC Decoder on FPGA (opens in a new tab)

  17. VLSI algorithms and architectures for non-binary-LDPC decoding

    … softdecision decoding algorithms (Q-ary Sum of Products (QSPA), Extended Min-Sum (EMS), Min-Max and Trellis-Extended Min-Sum (T-EMS)) and their corresponding hardware architectures. Despite the limitations of T-EMS algorithm (high complexity in the Check Node (CN) processor, wiring …

    upv Repository record for VLSI algorithms and architectures for non-binary-LDPC decoding (opens in a new tab)

  18. Online algorithms for dynamic aggregation problems

    … problems that are generalizations of prominent and well studied online problems. In the online setting, we additionally assume that the input arrives piece-by-piece and that the online algorithm has to provide a solution for the input piece of the current stage before it sees the upcoming …

    greece Repository record for Online algorithms for dynamic aggregation problems (opens in a new tab)

Page 1 of 3