JAMDS
2002
13 years 10 months ago
2002
This paper draws attention to the risk of rounding error in the numerical evaluation of steady-state probabilities for the M/M family of queues. A method for avoiding the risk is p...
SIAMSC
2008
13 years 10 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
COMGEO
2007
ACM
13 years 11 months ago
2007
ACM
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classic...
IPCO
1996
14 years 6 days ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
FSTTCS
2006
Springer
14 years 2 months ago
2006
Springer
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variant...