Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity has led to several remarkable new results and also simpler proofs of many previous results. We will briefly survey some applications of the method, including some recent developments and giving a high level overview of the ideas
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
Abstract. This paper determines the vertices and surface volumes of all rounding polytopes for the m...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
We give a general method for rounding linear programs that combines the commonly used iterated round...
Due to the limited number of bits in floating-point or fixed-point arithmetic, rounding is a necessa...
International audienceStochastic rounding randomly maps a real number to one of the two nearest valu...
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
Stochastic rounding (SR) randomly maps a real number x to one of the two nearest values in a finite ...
The paper determines the vertices and surface volumes of all rounding polytopes for com-monly used r...
Thesis (Ph.D.)--University of Washington, 2021Computer number systems are one of the most fundamenta...
In the presented work, we are introduced to the problem of rounding. In the process of numerous huma...
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
Abstract. This paper determines the vertices and surface volumes of all rounding polytopes for the m...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity ...
We give a general method for rounding linear programs that combines the commonly used iterated round...
Due to the limited number of bits in floating-point or fixed-point arithmetic, rounding is a necessa...
International audienceStochastic rounding randomly maps a real number to one of the two nearest valu...
Rounding with multiplier methods : an efficient algorithm and applications in statistics / Gregor Do...
Stochastic rounding (SR) randomly maps a real number x to one of the two nearest values in a finite ...
The paper determines the vertices and surface volumes of all rounding polytopes for com-monly used r...
Thesis (Ph.D.)--University of Washington, 2021Computer number systems are one of the most fundamenta...
In the presented work, we are introduced to the problem of rounding. In the process of numerous huma...
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
Abstract. This paper determines the vertices and surface volumes of all rounding polytopes for the m...
DOI
Add to ORKG