778 search results - page 1 / 156 » Bounding Smooth Integers |
ANTS
1998
Springer
15 years 4 months ago
1998
Springer
113
click to vote
IPCO
2007
15 years 1 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
116
click to vote
MP
2007
14 years 12 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
ANTS
2006
Springer
15 years 4 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
127
Voted
ICML
2001
IEEE
16 years 1 months ago
2001
IEEE
This work is concerned with the estimation of a classifier's accuracy. We first review some existing methods for error estimation, focusing on cross-validation and bootstrap,...