Karloo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semideenite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well...

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 time O((n + I) log n), where I is the number of intersections between the input segments. In the worst case, our algorithm is an order of magnitude more efficient than the best previously known algorithms. We also propo...

In this paper, we examine whether Bayesian networks are sensitive to precision of their parameters in the context of Hepar II, a sizeable Bayesian network model for diagnosis of liver disorders. Rather than entering noise into probability distributions, which was done in prior studies, we change their precision, starting with the original values and rounding them systematically to progressively...

The rounding of point forecasts CPI inflation and the unemployment rate by U.S. Professional Forecasters is modest. There little evidence that are rounded to a greater extent in response higher perceived uncertainty surrounding future outcomes. clear probability decline rounded: over half forecast probabilities current quarter multiples ten. It found here these correlates with worse accuracy, a...

We develop new techniques for rounding packing integer programs using iterative randomized rounding. It is based on a novel application of multidimensional Brownian motion in R. Let ∼ x ∈ [0, 1] be a fractional feasible solution of a packing constraint Ax ≤ 1, A ∈ {0, 1} that maximizes a linear objective function. The independent randomized rounding method of Raghavan-Thompson rounds each varia...