778 search results - page 4 / 156 » Bounding Smooth Integers |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
JSC
1998
13 years 7 months ago
1998
Abstract. In this paper we give new, improved explicit upper bounds for the absolute values of the integer solutions and for the heights of S-integer solutions of elliptic equation...
ANOR
2007
13 years 7 months ago
2007
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - t...
CPAIOR
2010
Springer
14 years 9 days ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...