Publication

Minimum-Error Classes for Matching Parts

Thomas Alois Weber
2021
Journal Articles

Abstract

This paper examines the binning of two types of parts with random characteristics, so that a componentwise monotonic evaluation criterion exhibits a minimum deviation to a given target value over all possible realizations. The optimal matching classes are balanced in the sense that the maximum error needs to be the same over all matching classes. This condition allows for a complete solution of the minimum-error matching-class design problem in closed form.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Minimum-Error Classes for Matching Parts

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

Results on Sparse Integer Programming and Geometric Independent Sets