Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,430,545 papers from all fields of science
Search
Sign In
Create Free Account
Rounding
Known as:
Statistician's rounding
, Unbiased rounding
, Rounding function
Expand
Rounding a numerical value means replacing it by another value that is approximately equal but has a shorter, simpler, or more explicit…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Binary number
Binary-coded decimal
Bitwise operation
C mathematical functions
Expand
Broader (1)
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
An iterated greedy algorithm for the flowshop scheduling problem with blocking
Imma Ribas
,
R. Companys
,
X. Tort-Martorell
2011
Corpus ID: 15734611
Highly Cited
2009
Highly Cited
2009
Cylinders with square cross-section: wake instabilities with incidence angle variation
G. Sheard
,
M. Fitzgerald
,
K. Ryan
Journal of Fluid Mechanics
2009
Corpus ID: 55642302
The wakes behind square cylinders with variation in incidence angle are computed over a range of Reynolds numbers to elucidate…
Expand
Highly Cited
2008
Highly Cited
2008
A Tree-Based Approach for Frequent Pattern Mining from Uncertain Data
C. Leung
,
M. Mateo
,
Dale A. Brajczuk
Pacific-Asia Conference on Knowledge Discovery…
2008
Corpus ID: 8279314
Many frequent pattern mining algorithms find patterns from traditional transaction databases, in which the content of each…
Expand
Highly Cited
2005
Highly Cited
2005
Crime Analysis for Problem Solvers in 60 Small Steps
R. Clarke
,
J. Eck
2005
Corpus ID: 157569332
his is a revised and extended version of a manual, Become a Problem-Solving Crime Analyst, that we wrote for the Jill Dando…
Expand
Highly Cited
2003
Highly Cited
2003
A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
Francisco Ortega
,
L. Wolsey
Networks
2003
Corpus ID: 33426423
We present a branch‐and‐cut algorithm to solve the single‐commodity, uncapacitated, fixed‐charge network flow problem, which…
Expand
Highly Cited
1992
Highly Cited
1992
Approximations with Minimum Packing Constraint Violation
Jyh-Han Lin
,
J. Vitter
1992
Corpus ID: 6846353
We present efficient new randomized and deterministic methods for transforming optimal solutions for a type of relaxed integer…
Expand
Highly Cited
1983
Highly Cited
1983
World Development Report 1983
W. Bank
1983
Corpus ID: 146102758
Highly Cited
1983
Highly Cited
1983
Finite-size effects at first-order transitions
V. Privman
,
M. Fisher
1983
Corpus ID: 56038367
Highly Cited
1983
Highly Cited
1983
Solving Algebraic Problems with High Accuracy
S. Rump
IMACS World Congress
1983
Corpus ID: 6189266
Highly Cited
1956
Highly Cited
1956
How to Lie with Statistics
D. Huff
,
I. Geis
1956
Corpus ID: 121770549
Darrell Huff runs the gamut of every popularly used type of statistic, probes such things as the sample study, the tabulation…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE