Add to ORKGRounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Dorfleitner ; Thomas Klein. - In: Statistical papers. 40. 1999. S. 143-15
Discretization methods to round an approximate design into an exact design for a given sample size n...
When rounding a finite set of probabilities to integral multiples of 1/n, multiplier methods guarant...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
Rounding probabilities : maximum probability and minimum complexity multipliers / F. Pukelsheim, M. ...
Rounding probabilities: unbiased multipliers / Max Happacher ; Friedrich Pukelsheim. - In: Statistic...
Efficient rounding of approximate designs / F. Pukelsheim ; S. Rieder. - In: Biometrika. 79. 1992. S...
The paper determines the vertices and surface volumes of all rounding polytopes for com-monly used r...
Abstract. This paper determines the vertices and surface volumes of all rounding polytopes for the m...
This report reviews some approximation algorithms for combinatorial optimization problems, base
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
A detailed investigation of three different rounding rules for multiplication and division is presen...
AbstractThe paper determines the vertices and surface volumes of all rounding polytopes for commonly...
In the presented work, we are introduced to the problem of rounding. In the process of numerous huma...
International audienceStochastic rounding randomly maps a real number to one of the two nearest valu...
Discretization methods to round an approximate design into an exact design for a given sample size n...
When rounding a finite set of probabilities to integral multiples of 1/n, multiplier methods guarant...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
Rounding probabilities : maximum probability and minimum complexity multipliers / F. Pukelsheim, M. ...
Rounding probabilities: unbiased multipliers / Max Happacher ; Friedrich Pukelsheim. - In: Statistic...
Efficient rounding of approximate designs / F. Pukelsheim ; S. Rieder. - In: Biometrika. 79. 1992. S...
The paper determines the vertices and surface volumes of all rounding polytopes for com-monly used r...
Abstract. This paper determines the vertices and surface volumes of all rounding polytopes for the m...
This report reviews some approximation algorithms for combinatorial optimization problems, base
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
A detailed investigation of three different rounding rules for multiplication and division is presen...
AbstractThe paper determines the vertices and surface volumes of all rounding polytopes for commonly...
In the presented work, we are introduced to the problem of rounding. In the process of numerous huma...
International audienceStochastic rounding randomly maps a real number to one of the two nearest valu...
Discretization methods to round an approximate design into an exact design for a given sample size n...
When rounding a finite set of probabilities to integral multiples of 1/n, multiplier methods guarant...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...